9,150,024
23 × 3 × 13 × 29327
Abundant
Even
Composite
9,150,024 factors as 2^3 × 3 × 13 × 29327. Its 32 positive divisors give a proper-divisor sum of 15,485,496, so this integer is abundant. The Collatz stopping time is 119 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 13 × 29327
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
24,635,520
Proper Divisor Sum
15,485,496
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#9150019 ← → #9150041
Radix Representation
| Decimal | 9150024 |
| Binary | 100010111001111001001000 (24 bits) |
| Octal | 0o42717110 |
| Hexadecimal | 0x8B9E48 |
Divisor Catalog (5 of 32)
Collatz Trajectory (119 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.