9,954,656

2⁵ × 17 × 29 × 631

9,954,656 factors as 2^5 × 17 × 29 × 631. Its 48 positive divisors give a proper-divisor sum of 11,545,984, so this integer is abundant. The Collatz stopping time is 238 steps.

Prime Factor Structure

Factorization String 2^5 × 17 × 29 × 631

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 21,500,640

Proper Divisor Sum 11,545,984

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #9954617 ← → #9954667

Radix Representation

Decimal	9954656
Binary	100101111110010101100000 (24 bits)
Octal	0o45762540
Hexadecimal	0x97E560

Divisor Catalog (48)

1 2 4 8 16 17 29 32 34 58 68 116 136 232 272 464 493 544 631 928 986 1,262 1,972 2,524 3,944 5,048 7,888 10,096 10,727 15,776 18,299 20,192 21,454 36,598 42,908 73,196 85,816 146,392 171,632 292,784 311,083 343,264 585,568 622,166 1,244,332 2,488,664 4,977,328 9,954,656

Collatz Trajectory (238 steps to reach 1)

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

9,954,656 4,977,328 2,488,664 1,244,332 622,166 311,083 933,250 466,625 1,399,876 699,938 349,969 1,049,908 524,954 262,477 787,432 393,716 196,858 98,429 295,288 147,644 73,822 36,911 110,734 55,367 166,102 83,051 249,154 124,577 373,732 186,866 93,433 280,300 140,150 70,075 210,226 105,113 315,340 157,670 78,835 236,506 118,253 354,760 177,380 88,690 44,345 133,036 66,518 33,259 99,778 49,889 149,668 74,834 37,417 112,252 56,126 28,063 84,190 42,095 126,286 63,143

← Previous Integer #9,954,655 Browse Full Index Next Integer #9,954,657 →