9,028,122
2 × 3 × 17 × 61 × 1451
Abundant
Even
Composite
9,028,122 factors as 2 × 3 × 17 × 61 × 1451. Its 32 positive divisors give a proper-divisor sum of 10,417,062, so this integer is abundant. The Collatz stopping time is 111 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 17 × 61 × 1451
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
19,445,184
Proper Divisor Sum
10,417,062
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#9028109 ← → #9028141
Radix Representation
| Decimal | 9028122 |
| Binary | 100010011100001000011010 (24 bits) |
| Octal | 0o42341032 |
| Hexadecimal | 0x89C21A |
Divisor Catalog (5 of 32)
Collatz Trajectory (111 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.