8,911,632
24 × 3 × 31 × 53 × 113
Abundant
Even
Composite
8,911,632 factors as 2^4 × 3 × 31 × 53 × 113. Its 80 positive divisors give a proper-divisor sum of 15,515,376, so this integer is abundant. The Collatz stopping time is 88 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 31 × 53 × 113
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
80
Divisor Sum (σ)
24,427,008
Proper Divisor Sum
15,515,376
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#8911631 ← → #8911633
Radix Representation
| Decimal | 8911632 |
| Binary | 100001111111101100010000 (24 bits) |
| Octal | 0o41775420 |
| Hexadecimal | 0x87FB10 |
Divisor Catalog (5 of 80)
Collatz Trajectory (88 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.