8,904,870
2 × 33 × 5 × 13 × 43 × 59
Abundant
Even
Composite
8,904,870 factors as 2 × 3^3 × 5 × 13 × 43 × 59. Its 128 positive divisors give a proper-divisor sum of 17,706,330, so this integer is abundant. The Collatz stopping time is 212 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 5 × 13 × 43 × 59
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
128
Divisor Sum (σ)
26,611,200
Proper Divisor Sum
17,706,330
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#8904869 ← → #8904871
Radix Representation
| Decimal | 8904870 |
| Binary | 100001111110000010100110 (24 bits) |
| Octal | 0o41760246 |
| Hexadecimal | 0x87E0A6 |
Divisor Catalog (5 of 128)
Collatz Trajectory (212 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.