The number 11961
11961 is a composite number with 8 divisors. Its prime factorisation is × 443. Divisors (8): 1, 3, 9, 27, 443, 1329, 3987, 11961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11961 is composite. Its prime factorisation is
- 3
The divisors add up to 17760; without 11961 itself that is 5799, so 11961 is deficient (5799 is less than 11961). Euler's totient φ(11961) = 7956 numbers up to 11961 share no factor with it.
- 4
The digits of 11961 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11961 = 3^{3} \times 443 \]11961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17760 |
| Euler totient φ(n) | 7956 |
| Square | 143065521 |
| Cube | 1711206696681 |
| Square root | 109.366357 (= 3√1329) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1961 × |
11961 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and sixty-one |
| Binary (base 2) | 10111010111001 |
| Octal (base 8) | 27271 |
| Hexadecimal (base 16) | 2EB9 |
| Base 3 | 121102000 |
| As time | 11961 seconds = 3 h 19 min 21 s |
Is 11961 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11961 ÷ 3 = 3987) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11961 ÷ 9 = 1329) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11961 a prime number?
No. 11961 = × 443, so it is divisible by 3.
What are the factors of 11961?
1, 3, 9, 27, 443, 1329, 3987, 11961.
What is 11961 in binary?
10111010111001 (hexadecimal 2EB9, octal 27271).
What is the square root of 11961?
About 109.3664, exactly 3√1329.
Is 11961 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11961?
It is a composite number with 8 divisors.