5,985,510
2 × 3 × 5 × 127 × 1571
Abundant
Even
Composite
5,985,510 factors as 2 × 3 × 5 × 127 × 1571. Its 32 positive divisors give a proper-divisor sum of 8,502,042, so this integer is abundant. The Collatz stopping time is 113 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 127 × 1571
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
14,487,552
Proper Divisor Sum
8,502,042
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#5985493 ← → #5985533
Radix Representation
| Decimal | 5985510 |
| Binary | 10110110101010011100110 (23 bits) |
| Octal | 0o26652346 |
| Hexadecimal | 0x5B54E6 |
Divisor Catalog (5 of 32)
Collatz Trajectory (113 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.