5,077,992
23 × 3 × 211583
Abundant
Even
Composite
5,077,992 factors as 2^3 × 3 × 211583. Its 16 positive divisors give a proper-divisor sum of 7,617,048, so this integer is abundant. The Collatz stopping time is 157 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 211583
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
12,695,040
Proper Divisor Sum
7,617,048
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#5077967 ← → #5077993
Radix Representation
| Decimal | 5077992 |
| Binary | 10011010111101111101000 (23 bits) |
| Octal | 0o23275750 |
| Hexadecimal | 0x4D7BE8 |
Divisor Catalog (5 of 16)
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.