The number 11982
11982 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1997. Divisors (8): 1, 2, 3, 6, 1997, 3994, 5991, 11982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11982 is composite. Its prime factorisation is
- 3
The divisors add up to 23976; without 11982 itself that is 11994, so 11982 is abundant (11994 is more than 11982). Euler's totient φ(11982) = 3992 numbers up to 11982 share no factor with it.
- 4
The digits of 11982 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11982 = 2 \times 3 \times 1997 \]
11982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23976 |
| Euler totient φ(n) | 3992 |
| Square | 143568324 |
| Cube | 1720235658168 |
| Square root | 109.462322 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.1982 × |
11982 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and eighty-two |
| Binary (base 2) | 10111011001110 |
| Octal (base 8) | 27316 |
| Hexadecimal (base 16) | 2ECE |
| Base 3 | 121102210 |
| As time | 11982 seconds = 3 h 19 min 42 s |
Is 11982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11982 ÷ 2 = 5991) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11982 ÷ 3 = 3994) | 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 (11982 ÷ 6 = 1997) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 11982 a prime number?
No. 11982 = 2 × 3 × 1997, so it is divisible by 2.
What are the factors of 11982?
1, 2, 3, 6, 1997, 3994, 5991, 11982.
What is 11982 in binary?
10111011001110 (hexadecimal 2ECE, octal 27316).
What is the square root of 11982?
About 109.4623.
Is 11982 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 11982?
It is a composite number with 8 divisors.