9,949,920
25 × 3 × 5 × 19 × 1091
Abundant
Even
Composite
9,949,920 factors as 2^5 × 3 × 5 × 19 × 1091. Its 96 positive divisors give a proper-divisor sum of 23,072,160, so this integer is abundant. The Collatz stopping time is 176 steps.
Prime Factor Structure
Factorization String
2^5 × 3 × 5 × 19 × 1091
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
96
Divisor Sum (σ)
33,022,080
Proper Divisor Sum
23,072,160
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#9949909 ← → #9949931
Radix Representation
| Decimal | 9949920 |
| Binary | 100101111101001011100000 (24 bits) |
| Octal | 0o45751340 |
| Hexadecimal | 0x97D2E0 |
Divisor Catalog (60 of 96)
Collatz Trajectory (176 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):