9,166,182
2 × 3 × 149 × 10253
Abundant
Even
Composite
9,166,182 factors as 2 × 3 × 149 × 10253. Its 16 positive divisors give a proper-divisor sum of 9,291,018, so this integer is abundant. The Collatz stopping time is 106 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 149 × 10253
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
18,457,200
Proper Divisor Sum
9,291,018
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9166159 ← → #9166187
Radix Representation
| Decimal | 9166182 |
| Binary | 100010111101110101100110 (24 bits) |
| Octal | 0o42756546 |
| Hexadecimal | 0x8BDD66 |
Divisor Catalog (5 of 16)
Collatz Trajectory (106 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.