6,868,266
2 × 3 × 739 × 1549
Abundant
Even
Composite
6,868,266 factors as 2 × 3 × 739 × 1549. Its 16 positive divisors give a proper-divisor sum of 6,895,734, so this integer is abundant. The Collatz stopping time is 222 steps.
Prime Factor Structure
Factorization String
2 × 3 × 739 × 1549
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
13,764,000
Proper Divisor Sum
6,895,734
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#6868247 ← → #6868297
Radix Representation
| Decimal | 6868266 |
| Binary | 11010001100110100101010 (23 bits) |
| Octal | 0o32146452 |
| Hexadecimal | 0x68CD2A |
Divisor Catalog (16)
Collatz Trajectory (222 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):