4,970,600
23 × 52 × 29 × 857
Abundant
Even
Composite
4,970,600 factors as 2^3 × 5^2 × 29 × 857. Its 48 positive divisors give a proper-divisor sum of 6,998,500, so this integer is abundant. The Collatz stopping time is 175 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5^2 × 29 × 857
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
11,969,100
Proper Divisor Sum
6,998,500
Digit Sum / Digital Root
26 (Root: 8)
Adjacent Primes
#4970591 ← → #4970611
Radix Representation
| Decimal | 4970600 |
| Binary | 10010111101100001101000 (23 bits) |
| Octal | 0o22754150 |
| Hexadecimal | 0x4BD868 |
Divisor Catalog (5 of 48)
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.