8,643,984
24 × 3 × 101 × 1783
Abundant
Even
Composite
8,643,984 factors as 2^4 × 3 × 101 × 1783. Its 40 positive divisors give a proper-divisor sum of 13,920,048, so this integer is abundant. The Collatz stopping time is 119 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 101 × 1783
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
22,564,032
Proper Divisor Sum
13,920,048
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#8643959 ← → #8643991
Radix Representation
| Decimal | 8643984 |
| Binary | 100000111110010110010000 (24 bits) |
| Octal | 0o40762620 |
| Hexadecimal | 0x83E590 |
Divisor Catalog (5 of 40)
Collatz Trajectory (119 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.