1,068,114
2 × 3 × 67 × 2657
Abundant
Even
Composite
1,068,114 factors as 2 × 3 × 67 × 2657. Its 16 positive divisors give a proper-divisor sum of 1,100,814, so this integer is abundant. The Collatz stopping time is 103 steps.
Prime Factor Structure
Factorization String
2 × 3 × 67 × 2657
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
2,168,928
Proper Divisor Sum
1,100,814
Digit Sum / Digital Root
21 (Root: 3)
Radix Representation
| Decimal | 1068114 |
| Binary | 100000100110001010010 (21 bits) |
| Octal | 0o4046122 |
| Hexadecimal | 0x104C52 |
Divisor Catalog (16)
Collatz Trajectory (103 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.