9,245,796
22 × 3 × 7 × 110069
Abundant
Even
Composite
9,245,796 factors as 2^2 × 3 × 7 × 110069. Its 24 positive divisors give a proper-divisor sum of 15,409,884, so this integer is abundant. The Collatz stopping time is 75 steps.
Prime Factor Structure
Factorization String
2^2 × 3 × 7 × 110069
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
24,655,680
Proper Divisor Sum
15,409,884
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#9245791 ← → #9245813
Radix Representation
| Decimal | 9245796 |
| Binary | 100011010001010001100100 (24 bits) |
| Octal | 0o43212144 |
| Hexadecimal | 0x8D1464 |
Divisor Catalog (24)
Collatz Trajectory (75 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):