4,886,934
2 × 3 × 13 × 62653
Abundant
Even
Composite
4,886,934 factors as 2 × 3 × 13 × 62653. Its 16 positive divisors give a proper-divisor sum of 5,638,938, so this integer is abundant. The Collatz stopping time is 237 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 62653
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
10,525,872
Proper Divisor Sum
5,638,938
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#4886929 ← → #4886941
Radix Representation
| Decimal | 4886934 |
| Binary | 10010101001000110010110 (23 bits) |
| Octal | 0o22510626 |
| Hexadecimal | 0x4A9196 |
Divisor Catalog (5 of 16)
Collatz Trajectory (237 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.