9,753,864

2³ × 3 × 197 × 2063

9,753,864 factors as 2^3 × 3 × 197 × 2063. Its 32 positive divisors give a proper-divisor sum of 14,766,456, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 197 × 2063

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 24,520,320

Proper Divisor Sum 14,766,456

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9753857 ← → #9753899

Radix Representation

Decimal	9753864
Binary	100101001101010100001000 (24 bits)
Octal	0o45152410
Hexadecimal	0x94D508

Divisor Catalog (32)

1 2 3 4 6 8 12 24 197 394 591 788 1,182 1,576 2,063 2,364 4,126 4,728 6,189 8,252 12,378 16,504 24,756 49,512 406,411 812,822 1,219,233 1,625,644 2,438,466 3,251,288 4,876,932 9,753,864

Collatz Trajectory (114 steps to reach 1)

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

9,753,864 4,876,932 2,438,466 1,219,233 3,657,700 1,828,850 914,425 2,743,276 1,371,638 685,819 2,057,458 1,028,729 3,086,188 1,543,094 771,547 2,314,642 1,157,321 3,471,964 1,735,982 867,991 2,603,974 1,301,987 3,905,962 1,952,981 5,858,944 2,929,472 1,464,736 732,368 366,184 183,092 91,546 45,773 137,320 68,660 34,330 17,165 51,496 25,748 12,874 6,437 19,312 9,656 4,828 2,414 1,207 3,622 1,811 5,434 2,717 8,152 4,076 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721

← Previous Integer #9,753,863 Browse Full Index Next Integer #9,753,865 →