9,549,738
2 × 34 × 11 × 23 × 233
Abundant
Even
Composite
9,549,738 factors as 2 × 3^4 × 11 × 23 × 233. Its 80 positive divisors give a proper-divisor sum of 14,913,558, so this integer is abundant. The Collatz stopping time is 101 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^4 × 11 × 23 × 233
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
80
Divisor Sum (σ)
24,463,296
Proper Divisor Sum
14,913,558
Digit Sum / Digital Root
45 (Root: 9)
Adjacent Primes
#9549721 ← → #9549739
Radix Representation
| Decimal | 9549738 |
| Binary | 100100011011011110101010 (24 bits) |
| Octal | 0o44333652 |
| Hexadecimal | 0x91B7AA |
Divisor Catalog (5 of 80)
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.