6,279,594
2 × 3 × 1046599
Abundant
Even
Composite
6,279,594 factors as 2 × 3 × 1046599. Its 8 positive divisors give a proper-divisor sum of 6,279,606, so this integer is abundant. The Collatz stopping time is 165 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1046599
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
12,559,200
Proper Divisor Sum
6,279,606
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#6279569 ← → #6279617
Radix Representation
| Decimal | 6279594 |
| Binary | 10111111101000110101010 (23 bits) |
| Octal | 0o27750652 |
| Hexadecimal | 0x5FD1AA |
Divisor Catalog (5 of 8)
Collatz Trajectory (165 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.