The number 11966
11966 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 193. Divisors (8): 1, 2, 31, 62, 193, 386, 5983, 11966.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11966 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11966 is composite. Its prime factorisation is
- 3
The divisors add up to 18624; without 11966 itself that is 6658, so 11966 is deficient (6658 is less than 11966). Euler's totient φ(11966) = 5760 numbers up to 11966 share no factor with it.
- 4
The digits of 11966 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11966 = 2 \times 31 \times 193 \]
11966 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18624 |
| Euler totient φ(n) | 5760 |
| Square | 143185156 |
| Cube | 1713353576696 |
| Square root | 109.389213 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1966 × |
11966 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and sixty-six |
| Binary (base 2) | 10111010111110 |
| Octal (base 8) | 27276 |
| Hexadecimal (base 16) | 2EBE |
| Base 3 | 121102012 |
| As time | 11966 seconds = 3 h 19 min 26 s |
Is 11966 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11966 ÷ 2 = 5983) | 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 1) | 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 3) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 11966 a prime number?
No. 11966 = 2 × 31 × 193, so it is divisible by 2.
What are the factors of 11966?
1, 2, 31, 62, 193, 386, 5983, 11966.
What is 11966 in binary?
10111010111110 (hexadecimal 2EBE, octal 27276).
What is the square root of 11966?
About 109.3892.
Is 11966 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 11966?
It is a composite number with 8 divisors.