9,271,182
2 × 3 × 181 × 8537
Abundant
Even
Composite
9,271,182 factors as 2 × 3 × 181 × 8537. Its 16 positive divisors give a proper-divisor sum of 9,375,810, so this integer is abundant. The Collatz stopping time is 225 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 181 × 8537
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
18,646,992
Proper Divisor Sum
9,375,810
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9271169 ← → #9271193
Radix Representation
| Decimal | 9271182 |
| Binary | 100011010111011110001110 (24 bits) |
| Octal | 0o43273616 |
| Hexadecimal | 0x8D778E |
Divisor Catalog (5 of 16)
Collatz Trajectory (225 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.