5,701,698
2 × 33 × 17 × 6211
Abundant
Even
Composite
5,701,698 factors as 2 × 3^3 × 17 × 6211. Its 32 positive divisors give a proper-divisor sum of 7,716,222, so this integer is abundant. The Collatz stopping time is 307 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 17 × 6211
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
13,417,920
Proper Divisor Sum
7,716,222
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#5701693 ← → #5701727
Radix Representation
| Decimal | 5701698 |
| Binary | 10101110000000001000010 (23 bits) |
| Octal | 0o25600102 |
| Hexadecimal | 0x570042 |
Divisor Catalog (5 of 32)
Collatz Trajectory (307 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.