9,899,010
2 × 34 × 5 × 112 × 101
Abundant
Even
Composite
9,899,010 factors as 2 × 3^4 × 5 × 11^2 × 101. Its 120 positive divisors give a proper-divisor sum of 19,647,738, so this integer is abundant. The Collatz stopping time is 282 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^4 × 5 × 11^2 × 101
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
120
Divisor Sum (σ)
29,546,748
Proper Divisor Sum
19,647,738
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#9899009 ← → #9899023
Radix Representation
| Decimal | 9899010 |
| Binary | 100101110000110000000010 (24 bits) |
| Octal | 0o45606002 |
| Hexadecimal | 0x970C02 |
Divisor Catalog (5 of 120)
Collatz Trajectory (282 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.