9,999,000

2³ × 3² × 5³ × 11 × 101

9,999,000 factors as 2^3 × 3^2 × 5^3 × 11 × 101. Its 192 positive divisors give a proper-divisor sum of 27,235,080, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 5^3 × 11 × 101

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 192

Divisor Sum (σ) 37,234,080

Proper Divisor Sum 27,235,080

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9998977 ← → #9999047

Radix Representation

Decimal	9999000
Binary	100110001001001010011000 (24 bits)
Octal	0o46111230
Hexadecimal	0x989298

Divisor Catalog (60 of 192)

1 2 3 4 5 6 8 9 10 11 12 15 18 20 22 24 25 30 33 36 40 44 45 50 55 60 66 72 75 88 90 99 100 101 110 120 125 132 150 165 180 198 200 202 220 225 250 264 275 300 303 330 360 375 396 404 440 450 495 500

Collatz Trajectory (70 steps to reach 1)

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

9,999,000 4,999,500 2,499,750 1,249,875 3,749,626 1,874,813 5,624,440 2,812,220 1,406,110 703,055 2,109,166 1,054,583 3,163,750 1,581,875 4,745,626 2,372,813 7,118,440 3,559,220 1,779,610 889,805 2,669,416 1,334,708 667,354 333,677 1,001,032 500,516 250,258 125,129 375,388 187,694 93,847 281,542 140,771 422,314 211,157 633,472 316,736 158,368 79,184 39,592 19,796 9,898 4,949 14,848 7,424 3,712 1,856 928 464 232 116 58 29 88 44 22 11 34 17 52

← Previous Integer #9,998,999 Browse Full Index Next Integer #9,999,001 →