9,456,630

2 × 3 × 5 × 101 × 3121

9,456,630 factors as 2 × 3 × 5 × 101 × 3121. Its 32 positive divisors give a proper-divisor sum of 13,471,338, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 101 × 3121

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 22,927,968

Proper Divisor Sum 13,471,338

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9456617 ← → #9456637

Radix Representation

Decimal	9456630
Binary	100100000100101111110110 (24 bits)
Octal	0o44045766
Hexadecimal	0x904BF6

Divisor Catalog (32)

1 2 3 5 6 10 15 30 101 202 303 505 606 1,010 1,515 3,030 3,121 6,242 9,363 15,605 18,726 31,210 46,815 93,630 315,221 630,442 945,663 1,576,105 1,891,326 3,152,210 4,728,315 9,456,630

Collatz Trajectory (88 steps to reach 1)

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

9,456,630 4,728,315 14,184,946 7,092,473 21,277,420 10,638,710 5,319,355 15,958,066 7,979,033 23,937,100 11,968,550 5,984,275 17,952,826 8,976,413 26,929,240 13,464,620 6,732,310 3,366,155 10,098,466 5,049,233 15,147,700 7,573,850 3,786,925 11,360,776 5,680,388 2,840,194 1,420,097 4,260,292 2,130,146 1,065,073 3,195,220 1,597,610 798,805 2,396,416 1,198,208 599,104 299,552 149,776 74,888 37,444 18,722 9,361 28,084 14,042 7,021 21,064 10,532 5,266 2,633 7,900 3,950 1,975 5,926 2,963 8,890 4,445 13,336 6,668 3,334 1,667

← Previous Integer #9,456,629 Browse Full Index Next Integer #9,456,631 →