9,666,630

2 × 3² × 5 × 19 × 5653

9,666,630 factors as 2 × 3^2 × 5 × 19 × 5653. Its 48 positive divisors give a proper-divisor sum of 16,794,090, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 19 × 5653

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 26,460,720

Proper Divisor Sum 16,794,090

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9666623 ← → #9666661

Radix Representation

Decimal	9666630
Binary	100100111000000001000110 (24 bits)
Octal	0o44700106
Hexadecimal	0x938046

Divisor Catalog (48)

1 2 3 5 6 9 10 15 18 19 30 38 45 57 90 95 114 171 190 285 342 570 855 1,710 5,653 11,306 16,959 28,265 33,918 50,877 56,530 84,795 101,754 107,407 169,590 214,814 254,385 322,221 508,770 537,035 644,442 966,663 1,074,070 1,611,105 1,933,326 3,222,210 4,833,315 9,666,630

Collatz Trajectory (114 steps to reach 1)

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

9,666,630 4,833,315 14,499,946 7,249,973 21,749,920 10,874,960 5,437,480 2,718,740 1,359,370 679,685 2,039,056 1,019,528 509,764 254,882 127,441 382,324 191,162 95,581 286,744 143,372 71,686 35,843 107,530 53,765 161,296 80,648 40,324 20,162 10,081 30,244 15,122 7,561 22,684 11,342 5,671 17,014 8,507 25,522 12,761 38,284 19,142 9,571 28,714 14,357 43,072 21,536 10,768 5,384 2,692 1,346 673 2,020 1,010 505 1,516 758 379 1,138 569 1,708

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