1,105,170
2 × 3 × 5 × 11 × 17 × 197
Abundant
Even
Composite
1,105,170 factors as 2 × 3 × 5 × 11 × 17 × 197. Its 64 positive divisors give a proper-divisor sum of 1,974,126, so this integer is abundant. The Collatz stopping time is 72 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 11 × 17 × 197
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
3,079,296
Proper Divisor Sum
1,974,126
Digit Sum / Digital Root
15 (Root: 6)
Adjacent Primes
#1105163 ← → #1105171
Radix Representation
| Decimal | 1105170 |
| Binary | 100001101110100010010 (21 bits) |
| Octal | 0o4156422 |
| Hexadecimal | 0x10DD12 |
Divisor Catalog (5 of 64)
Collatz Trajectory (72 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.