9,553,716
22 × 32 × 265381
Abundant
Even
Composite
9,553,716 factors as 2^2 × 3^2 × 265381. Its 18 positive divisors give a proper-divisor sum of 14,596,046, so this integer is abundant. The Collatz stopping time is 101 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3^2 × 265381
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
18
Divisor Sum (σ)
24,149,762
Proper Divisor Sum
14,596,046
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#9553703 ← → #9553721
Radix Representation
| Decimal | 9553716 |
| Binary | 100100011100011100110100 (24 bits) |
| Octal | 0o44343464 |
| Hexadecimal | 0x91C734 |
Divisor Catalog (5 of 18)
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.