2,109,666
2 × 3 × 13 × 17 × 37 × 43
Abundant
Even
Composite
2,109,666 factors as 2 × 3 × 13 × 17 × 37 × 43. Its 64 positive divisors give a proper-divisor sum of 2,946,462, so this integer is abundant. The Collatz stopping time is 104 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 17 × 37 × 43
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
5,056,128
Proper Divisor Sum
2,946,462
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#2109647 ← → #2109671
Radix Representation
| Decimal | 2109666 |
| Binary | 1000000011000011100010 (22 bits) |
| Octal | 0o10030342 |
| Hexadecimal | 0x2030E2 |
Divisor Catalog (5 of 64)
Collatz Trajectory (104 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.