8,407,434
2 × 3 × 7 × 200177
Abundant
Even
Composite
8,407,434 factors as 2 × 3 × 7 × 200177. Its 16 positive divisors give a proper-divisor sum of 10,809,654, so this integer is abundant. The Collatz stopping time is 124 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 200177
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,217,088
Proper Divisor Sum
10,809,654
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#8407433 ← → #8407439
Radix Representation
| Decimal | 8407434 |
| Binary | 100000000100100110001010 (24 bits) |
| Octal | 0o40044612 |
| Hexadecimal | 0x80498A |
Divisor Catalog (5 of 16)
Collatz Trajectory (124 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.