9,474,556

2² × 7 × 13 × 26029

9,474,556 factors as 2^2 × 7 × 13 × 26029. Its 24 positive divisors give a proper-divisor sum of 10,932,964, so this integer is abundant. The Collatz stopping time is 349 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 13 × 26029

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 20,407,520

Proper Divisor Sum 10,932,964

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #9474541 ← → #9474571

Radix Representation

Decimal	9474556
Binary	100100001001000111111100 (24 bits)
Octal	0o44110774
Hexadecimal	0x9091FC

Divisor Catalog (24)

1 2 4 7 13 14 26 28 52 91 182 364 26,029 52,058 104,116 182,203 338,377 364,406 676,754 728,812 1,353,508 2,368,639 4,737,278 9,474,556

Collatz Trajectory (349 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

9,474,556 4,737,278 2,368,639 7,105,918 3,552,959 10,658,878 5,329,439 15,988,318 7,994,159 23,982,478 11,991,239 35,973,718 17,986,859 53,960,578 26,980,289 80,940,868 40,470,434 20,235,217 60,705,652 30,352,826 15,176,413 45,529,240 22,764,620 11,382,310 5,691,155 17,073,466 8,536,733 25,610,200 12,805,100 6,402,550 3,201,275 9,603,826 4,801,913 14,405,740 7,202,870 3,601,435 10,804,306 5,402,153 16,206,460 8,103,230 4,051,615 12,154,846 6,077,423 18,232,270 9,116,135 27,348,406 13,674,203 41,022,610 20,511,305 61,533,916 30,766,958 15,383,479 46,150,438 23,075,219 69,225,658 34,612,829 103,838,488 51,919,244 25,959,622 12,979,811

← Previous Integer #9,474,555 Browse Full Index Next Integer #9,474,557 →