9,008,880
24 × 3 × 5 × 37537
Abundant
Even
Composite
9,008,880 factors as 2^4 × 3 × 5 × 37537. Its 40 positive divisors give a proper-divisor sum of 18,919,392, so this integer is abundant. The Collatz stopping time is 137 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 5 × 37537
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
27,928,272
Proper Divisor Sum
18,919,392
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9008873 ← → #9008899
Radix Representation
| Decimal | 9008880 |
| Binary | 100010010111011011110000 (24 bits) |
| Octal | 0o42273360 |
| Hexadecimal | 0x8976F0 |
Divisor Catalog (5 of 40)
Collatz Trajectory (137 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.