9,425,664

2⁸ × 3² × 4091

9,425,664 factors as 2^8 × 3^2 × 4091. Its 54 positive divisors give a proper-divisor sum of 17,757,492, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2^8 × 3^2 × 4091

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 54

Divisor Sum (σ) 27,183,156

Proper Divisor Sum 17,757,492

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9425641 ← → #9425683

Radix Representation

Decimal	9425664
Binary	100011111101001100000000 (24 bits)
Octal	0o43751400
Hexadecimal	0x8FD300

Divisor Catalog (54)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 64 72 96 128 144 192 256 288 384 576 768 1,152 2,304 4,091 8,182 12,273 16,364 24,546 32,728 36,819 49,092 65,456 73,638 98,184 130,912 147,276 196,368 261,824 294,552 392,736 523,648 589,104 785,472 1,047,296 1,178,208 1,570,944 2,356,416 3,141,888 4,712,832 9,425,664

Collatz Trajectory (75 steps to reach 1)

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

9,425,664 4,712,832 2,356,416 1,178,208 589,104 294,552 147,276 73,638 36,819 110,458 55,229 165,688 82,844 41,422 20,711 62,134 31,067 93,202 46,601 139,804 69,902 34,951 104,854 52,427 157,282 78,641 235,924 117,962 58,981 176,944 88,472 44,236 22,118 11,059 33,178 16,589 49,768 24,884 12,442 6,221 18,664 9,332 4,666 2,333 7,000 3,500 1,750 875 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664

← Previous Integer #9,425,663 Browse Full Index Next Integer #9,425,665 →