1,191,918
2 × 3 × 7 × 13 × 37 × 59
Abundant
Even
Composite
1,191,918 factors as 2 × 3 × 7 × 13 × 37 × 59. Its 64 positive divisors give a proper-divisor sum of 1,872,402, so this integer is abundant. The Collatz stopping time is 297 steps.
Prime Factor Structure
Factorization String
2 × 3 × 7 × 13 × 37 × 59
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
3,064,320
Proper Divisor Sum
1,872,402
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#1191899 ← → #1191923
Radix Representation
| Decimal | 1191918 |
| Binary | 100100010111111101110 (21 bits) |
| Octal | 0o4427756 |
| Hexadecimal | 0x122FEE |
Divisor Catalog (60 of 64)
Collatz Trajectory (297 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):