5,000,514
2 × 3 × 163 × 5113
Abundant
Even
Composite
5,000,514 factors as 2 × 3 × 163 × 5113. Its 16 positive divisors give a proper-divisor sum of 5,063,838, so this integer is abundant. The Collatz stopping time is 219 steps.
Prime Factor Structure
Factorization String
2 × 3 × 163 × 5113
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
10,064,352
Proper Divisor Sum
5,063,838
Digit Sum / Digital Root
15 (Root: 6)
Radix Representation
| Decimal | 5000514 |
| Binary | 10011000100110101000010 (23 bits) |
| Octal | 0o23046502 |
| Hexadecimal | 0x4C4D42 |
Divisor Catalog (16)
Collatz Trajectory (219 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.