2,698,160
24 × 5 × 29 × 1163
Abundant
Even
Composite
2,698,160 factors as 2^4 × 5 × 29 × 1163. Its 40 positive divisors give a proper-divisor sum of 3,796,960, so this integer is abundant. The Collatz stopping time is 86 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 5 × 29 × 1163
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
6,495,120
Proper Divisor Sum
3,796,960
Digit Sum / Digital Root
32 (Root: 5)
Adjacent Primes
#2698159 ← → #2698181
Radix Representation
| Decimal | 2698160 |
| Binary | 1010010010101110110000 (22 bits) |
| Octal | 0o12225660 |
| Hexadecimal | 0x292BB0 |
Divisor Catalog (5 of 40)
Collatz Trajectory (86 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.