9,999,600
24 × 3 × 52 × 13 × 641
Abundant
Even
Composite
9,999,600 factors as 2^4 × 3 × 5^2 × 13 × 641. Its 120 positive divisors give a proper-divisor sum of 24,550,272, so this integer is abundant. The Collatz stopping time is 220 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 5^2 × 13 × 641
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
120
Divisor Sum (σ)
34,549,872
Proper Divisor Sum
24,550,272
Digit Sum / Digital Root
42 (Root: 6)
Radix Representation
| Decimal | 9999600 |
| Binary | 100110001001010011110000 (24 bits) |
| Octal | 0o46112360 |
| Hexadecimal | 0x9894F0 |
Divisor Catalog (60 of 120)
Collatz Trajectory (220 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.