9,865,506
2 × 3 × 7 × 234893
Abundant
Even
Composite
9,865,506 factors as 2 × 3 × 7 × 234893. Its 16 positive divisors give a proper-divisor sum of 12,684,318, so this integer is abundant. The Collatz stopping time is 114 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 234893
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
22,549,824
Proper Divisor Sum
12,684,318
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#9865451 ← → #9865511
Radix Representation
| Decimal | 9865506 |
| Binary | 100101101000100100100010 (24 bits) |
| Octal | 0o45504442 |
| Hexadecimal | 0x968922 |
Divisor Catalog (5 of 16)
Collatz Trajectory (114 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.