9,804,114
2 × 32 × 19 × 109 × 263
Abundant
Even
Composite
9,804,114 factors as 2 × 3^2 × 19 × 109 × 263. Its 48 positive divisors give a proper-divisor sum of 12,847,086, so this integer is abundant. The Collatz stopping time is 119 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 19 × 109 × 263
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
22,651,200
Proper Divisor Sum
12,847,086
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#9804107 ← → #9804143
Radix Representation
| Decimal | 9804114 |
| Binary | 100101011001100101010010 (24 bits) |
| Octal | 0o45314522 |
| Hexadecimal | 0x959952 |
Divisor Catalog (48)
Collatz Trajectory (119 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):