9,076,416
26 × 3 × 41 × 1153
Abundant
Even
Composite
9,076,416 factors as 2^6 × 3 × 41 × 1153. Its 56 positive divisors give a proper-divisor sum of 15,545,328, so this integer is abundant. The Collatz stopping time is 88 steps.
Resources
Prime Factor Structure
Factorization String
2^6 × 3 × 41 × 1153
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
56
Divisor Sum (σ)
24,621,744
Proper Divisor Sum
15,545,328
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9076399 ← → #9076451
Radix Representation
| Decimal | 9076416 |
| Binary | 100010100111111011000000 (24 bits) |
| Octal | 0o42477300 |
| Hexadecimal | 0x8A7EC0 |
Divisor Catalog (5 of 56)
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.