The number 12662
12662 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 487. Divisors (8): 1, 2, 13, 26, 487, 974, 6331, 12662.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12662 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12662 is composite. Its prime factorisation is
- 3
The divisors add up to 20496; without 12662 itself that is 7834, so 12662 is deficient (7834 is less than 12662). Euler's totient φ(12662) = 5832 numbers up to 12662 share no factor with it.
- 4
The digits of 12662 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12662 = 2 \times 13 \times 487 \]
12662 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20496 |
| Euler totient φ(n) | 5832 |
| Square | 160326244 |
| Cube | 2030050901528 |
| Square root | 112.525553 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.2662 × |
12662 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and sixty-two |
| Binary (base 2) | 11000101110110 |
| Octal (base 8) | 30566 |
| Hexadecimal (base 16) | 3176 |
| Base 3 | 122100222 |
| As time | 12662 seconds = 3 h 31 min 2 s |
Is 12662 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12662 ÷ 2 = 6331) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12662 a prime number?
No. 12662 = 2 × 13 × 487, so it is divisible by 2.
What are the factors of 12662?
1, 2, 13, 26, 487, 974, 6331, 12662.
What is 12662 in binary?
11000101110110 (hexadecimal 3176, octal 30566).
What is the square root of 12662?
About 112.5256.
Is 12662 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12662?
It is a composite number with 8 divisors.