The number 10662
10662 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1777. Divisors (8): 1, 2, 3, 6, 1777, 3554, 5331, 10662.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10662 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10662 is composite. Its prime factorisation is
- 3
The divisors add up to 21336; without 10662 itself that is 10674, so 10662 is abundant (10674 is more than 10662). Euler's totient φ(10662) = 3552 numbers up to 10662 share no factor with it.
- 4
The digits of 10662 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10662 = 2 \times 3 \times 1777 \]
10662 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21336 |
| Euler totient φ(n) | 3552 |
| Square | 113678244 |
| Cube | 1212037437528 |
| Square root | 103.256961 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0662 × |
10662 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and sixty-two |
| Binary (base 2) | 10100110100110 |
| Octal (base 8) | 24646 |
| Hexadecimal (base 16) | 29A6 |
| Base 3 | 112121220 |
| As time | 10662 seconds = 2 h 57 min 42 s |
Is 10662 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10662 ÷ 2 = 5331) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10662 ÷ 3 = 3554) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10662 ÷ 6 = 1777) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10662 a prime number?
No. 10662 = 2 × 3 × 1777, so it is divisible by 2.
What are the factors of 10662?
1, 2, 3, 6, 1777, 3554, 5331, 10662.
What is 10662 in binary?
10100110100110 (hexadecimal 29A6, octal 24646).
What is the square root of 10662?
About 103.2570.
Is 10662 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10662?
It is a composite number with 8 divisors.