9,020,652
22 × 3 × 491 × 1531
Abundant
Even
Composite
9,020,652 factors as 2^2 × 3 × 491 × 1531. Its 24 positive divisors give a proper-divisor sum of 12,084,180, so this integer is abundant. The Collatz stopping time is 137 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3 × 491 × 1531
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
21,104,832
Proper Divisor Sum
12,084,180
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#9020639 ← → #9020657
Radix Representation
| Decimal | 9020652 |
| Binary | 100010011010010011101100 (24 bits) |
| Octal | 0o42322354 |
| Hexadecimal | 0x89A4EC |
Divisor Catalog (5 of 24)
Collatz Trajectory (137 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.