9,479,766
2 × 3 × 59 × 61 × 439
Abundant
Even
Composite
9,479,766 factors as 2 × 3 × 59 × 61 × 439. Its 32 positive divisors give a proper-divisor sum of 10,161,834, so this integer is abundant. The Collatz stopping time is 124 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 59 × 61 × 439
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
19,641,600
Proper Divisor Sum
10,161,834
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#9479753 ← → #9479783
Radix Representation
| Decimal | 9479766 |
| Binary | 100100001010011001010110 (24 bits) |
| Octal | 0o44123126 |
| Hexadecimal | 0x90A656 |
Divisor Catalog (5 of 32)
Collatz Trajectory (124 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.