9,777,222
2 × 32 × 7 × 13 × 47 × 127
Abundant
Even
Composite
9,777,222 factors as 2 × 3^2 × 7 × 13 × 47 × 127. Its 96 positive divisors give a proper-divisor sum of 17,059,770, so this integer is abundant. The Collatz stopping time is 114 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 7 × 13 × 47 × 127
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
96
Divisor Sum (σ)
26,836,992
Proper Divisor Sum
17,059,770
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#9777221 ← → #9777223
Radix Representation
| Decimal | 9777222 |
| Binary | 100101010011000001000110 (24 bits) |
| Octal | 0o45230106 |
| Hexadecimal | 0x953046 |
Divisor Catalog (5 of 96)
Collatz Trajectory (114 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.