6,881,406
2 × 3 × 7 × 59 × 2777
Abundant
Even
Composite
6,881,406 factors as 2 × 3 × 7 × 59 × 2777. Its 32 positive divisors give a proper-divisor sum of 9,119,874, so this integer is abundant. The Collatz stopping time is 116 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 59 × 2777
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
16,001,280
Proper Divisor Sum
9,119,874
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#6881389 ← → #6881417
Radix Representation
| Decimal | 6881406 |
| Binary | 11010010000000001111110 (23 bits) |
| Octal | 0o32200176 |
| Hexadecimal | 0x69007E |
Divisor Catalog (5 of 32)
Collatz Trajectory (116 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.