9,707,775
3 × 52 × 7 × 11 × 412
Abundant
Odd
Composite
9,707,775 factors as 3 × 5^2 × 7 × 11 × 41^2. Its 72 positive divisors give a proper-divisor sum of 10,802,817, so this integer is abundant. The Collatz stopping time is 119 steps.
Prime Factor Structure
Factorization String
3 × 5^2 × 7 × 11 × 41^2
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
72
Divisor Sum (σ)
20,510,592
Proper Divisor Sum
10,802,817
Digit Sum / Digital Root
42 (Root: 6)
Radix Representation
| Decimal | 9707775 |
| Binary | 100101000010000011111111 (24 bits) |
| Octal | 0o45020377 |
| Hexadecimal | 0x9420FF |
Divisor Catalog (60 of 72)
Collatz Trajectory (119 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.