9,040,928
25 × 13 × 103 × 211
Abundant
Even
Composite
9,040,928 factors as 2^5 × 13 × 103 × 211. Its 48 positive divisors give a proper-divisor sum of 10,405,408, so this integer is abundant. The Collatz stopping time is 88 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 13 × 103 × 211
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
19,446,336
Proper Divisor Sum
10,405,408
Digit Sum / Digital Root
32 (Root: 5)
Adjacent Primes
#9040919 ← → #9040931
Radix Representation
| Decimal | 9040928 |
| Binary | 100010011111010000100000 (24 bits) |
| Octal | 0o42372040 |
| Hexadecimal | 0x89F420 |
Divisor Catalog (5 of 48)
Collatz Trajectory (88 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.