6,574,758
2 × 3 × 1095793
Abundant
Even
Composite
6,574,758 factors as 2 × 3 × 1095793. Its 8 positive divisors give a proper-divisor sum of 6,574,770, so this integer is abundant. The Collatz stopping time is 116 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1095793
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
13,149,528
Proper Divisor Sum
6,574,770
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#6574751 ← → #6574769
Radix Representation
| Decimal | 6574758 |
| Binary | 11001000101001010100110 (23 bits) |
| Octal | 0o31051246 |
| Hexadecimal | 0x6452A6 |
Divisor Catalog (5 of 8)
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.