9,115,410
2 × 3 × 5 × 311 × 977
Abundant
Even
Composite
9,115,410 factors as 2 × 3 × 5 × 311 × 977. Its 32 positive divisors give a proper-divisor sum of 12,854,382, so this integer is abundant. The Collatz stopping time is 106 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 311 × 977
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
21,969,792
Proper Divisor Sum
12,854,382
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#9115399 ← → #9115427
Radix Representation
| Decimal | 9115410 |
| Binary | 100010110001011100010010 (24 bits) |
| Octal | 0o42613422 |
| Hexadecimal | 0x8B1712 |
Divisor Catalog (5 of 32)
Collatz Trajectory (106 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.