9,550,086
2 × 3 × 7 × 13 × 17491
Abundant
Even
Composite
9,550,086 factors as 2 × 3 × 7 × 13 × 17491. Its 32 positive divisors give a proper-divisor sum of 13,959,162, so this integer is abundant. The Collatz stopping time is 101 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 13 × 17491
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
23,509,248
Proper Divisor Sum
13,959,162
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9550081 ← → #9550087
Radix Representation
| Decimal | 9550086 |
| Binary | 100100011011100100000110 (24 bits) |
| Octal | 0o44334406 |
| Hexadecimal | 0x91B906 |
Divisor Catalog (5 of 32)
Collatz Trajectory (101 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.