9,750,504
23 × 3 × 406271
Abundant
Even
Composite
9,750,504 factors as 2^3 × 3 × 406271. Its 16 positive divisors give a proper-divisor sum of 14,625,816, so this integer is abundant. The Collatz stopping time is 251 steps.
Prime Factor Structure
Factorization String
2^3 × 3 × 406271
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
24,376,320
Proper Divisor Sum
14,625,816
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 9750504 |
| Binary | 100101001100011111101000 (24 bits) |
| Octal | 0o45143750 |
| Hexadecimal | 0x94C7E8 |
Divisor Catalog (16)
Collatz Trajectory (251 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.