10,662,000
24 × 3 × 53 × 1777
Abundant
Even
Composite
10,662,000 factors as 2^4 × 3 × 5^3 × 1777. Its 80 positive divisors give a proper-divisor sum of 23,731,632, so this integer is abundant. The Collatz stopping time is 189 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 5^3 × 1777
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
80
Divisor Sum (σ)
34,393,632
Proper Divisor Sum
23,731,632
Digit Sum / Digital Root
15 (Root: 6)
Radix Representation
| Decimal | 10662000 |
| Binary | 101000101011000001110000 (24 bits) |
| Octal | 0o50530160 |
| Hexadecimal | 0xA2B070 |
Divisor Catalog (60 of 80)
Collatz Trajectory (189 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.