9,310,722
2 × 3 × 19 × 23 × 53 × 67
Abundant
Even
Composite
9,310,722 factors as 2 × 3 × 19 × 23 × 53 × 67. Its 64 positive divisors give a proper-divisor sum of 11,839,998, so this integer is abundant. The Collatz stopping time is 88 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 19 × 23 × 53 × 67
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
21,150,720
Proper Divisor Sum
11,839,998
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#9310681 ← → #9310733
Radix Representation
| Decimal | 9310722 |
| Binary | 100011100001001000000010 (24 bits) |
| Octal | 0o43411002 |
| Hexadecimal | 0x8E1202 |
Divisor Catalog (5 of 64)
Collatz Trajectory (88 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.