5,002,888
23 × 11 × 139 × 409
Abundant
Even
Composite
5,002,888 factors as 2^3 × 11 × 139 × 409. Its 32 positive divisors give a proper-divisor sum of 5,329,112, so this integer is abundant. The Collatz stopping time is 175 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 11 × 139 × 409
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
10,332,000
Proper Divisor Sum
5,329,112
Digit Sum / Digital Root
31 (Root: 4)
Adjacent Primes
#5002883 ← → #5002889
Radix Representation
| Decimal | 5002888 |
| Binary | 10011000101011010001000 (23 bits) |
| Octal | 0o23053210 |
| Hexadecimal | 0x4C5688 |
Divisor Catalog (5 of 32)
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.