The number 11986
11986 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 461. Divisors (8): 1, 2, 13, 26, 461, 922, 5993, 11986.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11986 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11986 is composite. Its prime factorisation is
- 3
The divisors add up to 19404; without 11986 itself that is 7418, so 11986 is deficient (7418 is less than 11986). Euler's totient φ(11986) = 5520 numbers up to 11986 share no factor with it.
- 4
The digits of 11986 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11986 = 2 \times 13 \times 461 \]
11986 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19404 |
| Euler totient φ(n) | 5520 |
| Square | 143664196 |
| Cube | 1721959053256 |
| Square root | 109.480592 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1986 × |
11986 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and eighty-six |
| Binary (base 2) | 10111011010010 |
| Octal (base 8) | 27322 |
| Hexadecimal (base 16) | 2ED2 |
| Base 3 | 121102221 |
| As time | 11986 seconds = 3 h 19 min 46 s |
Is 11986 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11986 ÷ 2 = 5993) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11986 a prime number?
No. 11986 = 2 × 13 × 461, so it is divisible by 2.
What are the factors of 11986?
1, 2, 13, 26, 461, 922, 5993, 11986.
What is 11986 in binary?
10111011010010 (hexadecimal 2ED2, octal 27322).
What is the square root of 11986?
About 109.4806.
Is 11986 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 11986?
It is a composite number with 8 divisors.