8,342,562
2 × 3 × 953 × 1459
Abundant
Even
Composite
8,342,562 factors as 2 × 3 × 953 × 1459. Its 16 positive divisors give a proper-divisor sum of 8,371,518, so this integer is abundant. The Collatz stopping time is 199 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 953 × 1459
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
16,714,080
Proper Divisor Sum
8,371,518
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#8342561 ← → #8342567
Radix Representation
| Decimal | 8342562 |
| Binary | 11111110100110000100010 (23 bits) |
| Octal | 0o37646042 |
| Hexadecimal | 0x7F4C22 |
Divisor Catalog (5 of 16)
Collatz Trajectory (199 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.