The number 11960
11960 is a composite number with 32 divisors. Its prime factorisation is × 5 × 13 × 23. Divisors (32): 1, 2, 4, 5, 8, 10, 13, 20, 23, 26, 40, 46, 52, 65, 92, 104 … 11960.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11960 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11960 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 11960 itself that is 18280, so 11960 is abundant (18280 is more than 11960). Euler's totient φ(11960) = 4224 numbers up to 11960 share no factor with it.
- 4
The digits of 11960 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11960 = 2^{3} \times 5 \times 13 \times 23 \]11960 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 4224 |
| Square | 143041600 |
| Cube | 1710777536000 |
| Square root | 109.361785 (= 2√2990) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.196 × |
11960 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and sixty |
| Binary (base 2) | 10111010111000 |
| Octal (base 8) | 27270 |
| Hexadecimal (base 16) | 2EB8 |
| Base 3 | 121101222 |
| As time | 11960 seconds = 3 h 19 min 20 s |
Is 11960 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11960 ÷ 2 = 5980) | 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 | Yes (11960 ÷ 4 = 2990) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11960 ÷ 5 = 2392) | 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 4) | 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 | Yes (11960 ÷ 8 = 1495) | 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 | Yes (11960 ÷ 10 = 1196) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11960 a prime number?
No. 11960 = × 5 × 13 × 23, so it is divisible by 2.
What are the factors of 11960?
1, 2, 4, 5, 8, 10, 13, 20, 23, 26, 40, 46, 52, 65, 92, 104, 115, 130, 184, 230, 260, 299, 460, 520, 598, 920, 1196, 1495, 2392, 2990, 5980, 11960.
What is 11960 in binary?
10111010111000 (hexadecimal 2EB8, octal 27270).
What is the square root of 11960?
About 109.3618, exactly 2√2990.
Is 11960 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11960?
It is a composite number with 32 divisors.