5,368,510
2 × 5 × 7 × 271 × 283
Abundant
Even
Composite
5,368,510 factors as 2 × 5 × 7 × 271 × 283. Its 32 positive divisors give a proper-divisor sum of 5,755,202, so this integer is abundant. The Collatz stopping time is 188 steps.
Resources
Prime Factor Structure
Factorization String
2 × 5 × 7 × 271 × 283
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
11,123,712
Proper Divisor Sum
5,755,202
Digit Sum / Digital Root
28 (Root: 1)
Adjacent Primes
#5368483 ← → #5368541
Radix Representation
| Decimal | 5368510 |
| Binary | 10100011110101010111110 (23 bits) |
| Octal | 0o24365276 |
| Hexadecimal | 0x51EABE |
Divisor Catalog (5 of 32)
Collatz Trajectory (188 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.