2,651,694
2 × 3 × 17 × 25997
Abundant
Even
Composite
2,651,694 factors as 2 × 3 × 17 × 25997. Its 16 positive divisors give a proper-divisor sum of 2,963,874, so this integer is abundant. The Collatz stopping time is 156 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 17 × 25997
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
5,615,568
Proper Divisor Sum
2,963,874
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#2651687 ← → #2651699
Radix Representation
| Decimal | 2651694 |
| Binary | 1010000111011000101110 (22 bits) |
| Octal | 0o12073056 |
| Hexadecimal | 0x28762E |
Divisor Catalog (5 of 16)
Collatz Trajectory (156 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.