5,001,858
2 × 33 × 92627
Abundant
Even
Composite
5,001,858 factors as 2 × 3^3 × 92627. Its 16 positive divisors give a proper-divisor sum of 6,113,502, so this integer is abundant. The Collatz stopping time is 175 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 92627
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
11,115,360
Proper Divisor Sum
6,113,502
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#5001809 ← → #5001907
Radix Representation
| Decimal | 5001858 |
| Binary | 10011000101001010000010 (23 bits) |
| Octal | 0o23051202 |
| Hexadecimal | 0x4C5282 |
Divisor Catalog (5 of 16)
Collatz Trajectory (175 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.