9,142,416
24 × 33 × 21163
Abundant
Even
Composite
9,142,416 factors as 2^4 × 3^3 × 21163. Its 40 positive divisors give a proper-divisor sum of 17,100,944, so this integer is abundant. The Collatz stopping time is 80 steps.
Prime Factor Structure
Factorization String
2^4 × 3^3 × 21163
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
26,243,360
Proper Divisor Sum
17,100,944
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#9142411 ← → #9142423
Radix Representation
| Decimal | 9142416 |
| Binary | 100010111000000010010000 (24 bits) |
| Octal | 0o42700220 |
| Hexadecimal | 0x8B8090 |
Divisor Catalog (40)
Collatz Trajectory (80 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):