6,377,802
2 × 3 × 659 × 1613
Abundant
Even
Composite
6,377,802 factors as 2 × 3 × 659 × 1613. Its 16 positive divisors give a proper-divisor sum of 6,405,078, so this integer is abundant. The Collatz stopping time is 134 steps.
Prime Factor Structure
Factorization String
2 × 3 × 659 × 1613
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
12,782,880
Proper Divisor Sum
6,405,078
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#6377783 ← → #6377807
Radix Representation
| Decimal | 6377802 |
| Binary | 11000010101000101001010 (23 bits) |
| Octal | 0o30250512 |
| Hexadecimal | 0x61514A |
Divisor Catalog (16)
Collatz Trajectory (134 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):