8,344,614
2 × 3 × 1069 × 1301
Abundant
Even
Composite
8,344,614 factors as 2 × 3 × 1069 × 1301. Its 16 positive divisors give a proper-divisor sum of 8,373,066, so this integer is abundant. The Collatz stopping time is 106 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1069 × 1301
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
16,717,680
Proper Divisor Sum
8,373,066
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#8344601 ← → #8344621
Radix Representation
| Decimal | 8344614 |
| Binary | 11111110101010000100110 (23 bits) |
| Octal | 0o37652046 |
| Hexadecimal | 0x7F5426 |
Divisor Catalog (5 of 16)
Collatz Trajectory (106 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.