9,407,024
24 × 112 × 43 × 113
Abundant
Even
Composite
9,407,024 factors as 2^4 × 11^2 × 43 × 113. Its 60 positive divisors give a proper-divisor sum of 11,273,944, so this integer is abundant. The Collatz stopping time is 150 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 11^2 × 43 × 113
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
60
Divisor Sum (σ)
20,680,968
Proper Divisor Sum
11,273,944
Digit Sum / Digital Root
26 (Root: 8)
Adjacent Primes
#9407009 ← → #9407029
Radix Representation
| Decimal | 9407024 |
| Binary | 100011111000101000110000 (24 bits) |
| Octal | 0o43705060 |
| Hexadecimal | 0x8F8A30 |
Divisor Catalog (5 of 60)
Collatz Trajectory (150 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.