9,069,100
22 × 52 × 89 × 1019
Abundant
Even
Composite
9,069,100 factors as 2^2 × 5^2 × 89 × 1019. Its 36 positive divisors give a proper-divisor sum of 10,851,500, so this integer is abundant. The Collatz stopping time is 93 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 5^2 × 89 × 1019
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
36
Divisor Sum (σ)
19,920,600
Proper Divisor Sum
10,851,500
Digit Sum / Digital Root
25 (Root: 7)
Adjacent Primes
#9069097 ← → #9069101
Radix Representation
| Decimal | 9069100 |
| Binary | 100010100110001000101100 (24 bits) |
| Octal | 0o42461054 |
| Hexadecimal | 0x8A622C |
Divisor Catalog (5 of 36)
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.