4,905,498
2 × 3 × 13 × 61 × 1031
Abundant
Even
Composite
4,905,498 factors as 2 × 3 × 13 × 61 × 1031. Its 32 positive divisors give a proper-divisor sum of 5,843,814, so this integer is abundant. The Collatz stopping time is 87 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 61 × 1031
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
10,749,312
Proper Divisor Sum
5,843,814
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#4905493 ← → #4905529
Radix Representation
| Decimal | 4905498 |
| Binary | 10010101101101000011010 (23 bits) |
| Octal | 0o22555032 |
| Hexadecimal | 0x4ADA1A |
Divisor Catalog (5 of 32)
Collatz Trajectory (87 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.