1,060,266
2 × 3 × 176711
Abundant
Even
Composite
1,060,266 factors as 2 × 3 × 176711. Its 8 positive divisors give a proper-divisor sum of 1,060,278, so this integer is abundant. The Collatz stopping time is 103 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 176711
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
2,120,544
Proper Divisor Sum
1,060,278
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#1060253 ← → #1060271
Radix Representation
| Decimal | 1060266 |
| Binary | 100000010110110101010 (21 bits) |
| Octal | 0o4026652 |
| Hexadecimal | 0x102DAA |
Divisor Catalog (5 of 8)
Collatz Trajectory (103 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.