9,639,112

2³ × 7 × 172127

9,639,112 factors as 2^3 × 7 × 172127. Its 16 positive divisors give a proper-divisor sum of 11,016,248, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 172127

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 20,655,360

Proper Divisor Sum 11,016,248

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #9639103 ← → #9639131

Radix Representation

Decimal	9639112
Binary	100100110001010011001000 (24 bits)
Octal	0o44612310
Hexadecimal	0x9314C8

Divisor Catalog (16)

1 2 4 7 8 14 28 56 172,127 344,254 688,508 1,204,889 1,377,016 2,409,778 4,819,556 9,639,112

Collatz Trajectory (145 steps to reach 1)

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

9,639,112 4,819,556 2,409,778 1,204,889 3,614,668 1,807,334 903,667 2,711,002 1,355,501 4,066,504 2,033,252 1,016,626 508,313 1,524,940 762,470 381,235 1,143,706 571,853 1,715,560 857,780 428,890 214,445 643,336 321,668 160,834 80,417 241,252 120,626 60,313 180,940 90,470 45,235 135,706 67,853 203,560 101,780 50,890 25,445 76,336 38,168 19,084 9,542 4,771 14,314 7,157 21,472 10,736 5,368 2,684 1,342 671 2,014 1,007 3,022 1,511 4,534 2,267 6,802 3,401 10,204

← Previous Integer #9,639,111 Browse Full Index Next Integer #9,639,113 →