5,078,800
24 × 52 × 12697
Abundant
Even
Composite
5,078,800 factors as 2^4 × 5^2 × 12697. Its 30 positive divisors give a proper-divisor sum of 7,123,978, so this integer is abundant. The Collatz stopping time is 157 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 5^2 × 12697
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
30
Divisor Sum (σ)
12,202,778
Proper Divisor Sum
7,123,978
Digit Sum / Digital Root
28 (Root: 1)
Adjacent Primes
#5078797 ← → #5078807
Radix Representation
| Decimal | 5078800 |
| Binary | 10011010111111100010000 (23 bits) |
| Octal | 0o23277420 |
| Hexadecimal | 0x4D7F10 |
Divisor Catalog (5 of 30)
Collatz Trajectory (157 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.