9,586,040
23 × 5 × 367 × 653
Abundant
Even
Composite
9,586,040 factors as 2^3 × 5 × 367 × 653. Its 32 positive divisors give a proper-divisor sum of 12,074,440, so this integer is abundant. The Collatz stopping time is 150 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5 × 367 × 653
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
21,660,480
Proper Divisor Sum
12,074,440
Digit Sum / Digital Root
32 (Root: 5)
Adjacent Primes
#9586039 ← → #9586061
Radix Representation
| Decimal | 9586040 |
| Binary | 100100100100010101111000 (24 bits) |
| Octal | 0o44442570 |
| Hexadecimal | 0x924578 |
Divisor Catalog (5 of 32)
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.