9,784,002
2 × 3 × 97 × 16811
Abundant
Even
Composite
9,784,002 factors as 2 × 3 × 97 × 16811. Its 16 positive divisors give a proper-divisor sum of 9,986,910, so this integer is abundant. The Collatz stopping time is 145 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 97 × 16811
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,770,912
Proper Divisor Sum
9,986,910
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9783989 ← → #9784007
Radix Representation
| Decimal | 9784002 |
| Binary | 100101010100101011000010 (24 bits) |
| Octal | 0o45245302 |
| Hexadecimal | 0x954AC2 |
Divisor Catalog (5 of 16)
Collatz Trajectory (145 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.