1,246,806
2 × 33 × 11 × 2099
Abundant
Even
Composite
1,246,806 factors as 2 × 3^3 × 11 × 2099. Its 32 positive divisors give a proper-divisor sum of 1,777,194, so this integer is abundant. The Collatz stopping time is 173 steps.
Prime Factor Structure
Factorization String
2 × 3^3 × 11 × 2099
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
3,024,000
Proper Divisor Sum
1,777,194
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#1246781 ← → #1246823
Radix Representation
| Decimal | 1246806 |
| Binary | 100110000011001010110 (21 bits) |
| Octal | 0o4603126 |
| Hexadecimal | 0x130656 |
Divisor Catalog (32)
Collatz Trajectory (173 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):