9,986,382
2 × 33 × 7 × 29 × 911
Abundant
Even
Composite
9,986,382 factors as 2 × 3^3 × 7 × 29 × 911. Its 64 positive divisors give a proper-divisor sum of 16,279,218, so this integer is abundant. The Collatz stopping time is 207 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 7 × 29 × 911
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
26,265,600
Proper Divisor Sum
16,279,218
Digit Sum / Digital Root
45 (Root: 9)
Adjacent Primes
#9986377 ← → #9986407
Radix Representation
| Decimal | 9986382 |
| Binary | 100110000110000101001110 (24 bits) |
| Octal | 0o46060516 |
| Hexadecimal | 0x98614E |
Divisor Catalog (5 of 64)
Collatz Trajectory (207 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.