9,609,138
2 × 33 × 7 × 11 × 2311
Abundant
Even
Composite
9,609,138 factors as 2 × 3^3 × 7 × 11 × 2311. Its 64 positive divisors give a proper-divisor sum of 17,025,102, so this integer is abundant. The Collatz stopping time is 93 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 7 × 11 × 2311
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
26,634,240
Proper Divisor Sum
17,025,102
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#9609133 ← → #9609139
Radix Representation
| Decimal | 9609138 |
| Binary | 100100101001111110110010 (24 bits) |
| Octal | 0o44517662 |
| Hexadecimal | 0x929FB2 |
Divisor Catalog (5 of 64)
Collatz Trajectory (93 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.