9,779,904

2⁶ × 3² × 16979

9,779,904 factors as 2^6 × 3^2 × 16979. Its 42 positive divisors give a proper-divisor sum of 18,254,076, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^6 × 3^2 × 16979

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 42

Divisor Sum (σ) 28,033,980

Proper Divisor Sum 18,254,076

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9779881 ← → #9779909

Radix Representation

Decimal	9779904
Binary	100101010011101011000000 (24 bits)
Octal	0o45235300
Hexadecimal	0x953AC0

Divisor Catalog (42)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 64 72 96 144 192 288 576 16,979 33,958 50,937 67,916 101,874 135,832 152,811 203,748 271,664 305,622 407,496 543,328 611,244 814,992 1,086,656 1,222,488 1,629,984 2,444,976 3,259,968 4,889,952 9,779,904

Collatz Trajectory (114 steps to reach 1)

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

9,779,904 4,889,952 2,444,976 1,222,488 611,244 305,622 152,811 458,434 229,217 687,652 343,826 171,913 515,740 257,870 128,935 386,806 193,403 580,210 290,105 870,316 435,158 217,579 652,738 326,369 979,108 489,554 244,777 734,332 367,166 183,583 550,750 275,375 826,126 413,063 1,239,190 619,595 1,858,786 929,393 2,788,180 1,394,090 697,045 2,091,136 1,045,568 522,784 261,392 130,696 65,348 32,674 16,337 49,012 24,506 12,253 36,760 18,380 9,190 4,595 13,786 6,893 20,680 10,340

← Previous Integer #9,779,903 Browse Full Index Next Integer #9,779,905 →