9,804,306
2 × 3 × 1634051
Abundant
Even
Composite
9,804,306 factors as 2 × 3 × 1634051. Its 8 positive divisors give a proper-divisor sum of 9,804,318, so this integer is abundant. The Collatz stopping time is 119 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1634051
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
19,608,624
Proper Divisor Sum
9,804,318
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9804299 ← → #9804317
Radix Representation
| Decimal | 9804306 |
| Binary | 100101011001101000010010 (24 bits) |
| Octal | 0o45315022 |
| Hexadecimal | 0x959A12 |
Divisor Catalog (5 of 8)
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.