The number 11965
11965 is a composite number with 4 divisors. Its prime factorisation is 5 × 2393. Divisors (4): 1, 5, 2393, 11965.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11965: a semiprime: 5 × 2393, the product of two primes.
- 2
11965 is composite. Its prime factorisation is
- 3
The divisors add up to 14364; without 11965 itself that is 2399, so 11965 is deficient (2399 is less than 11965). Euler's totient φ(11965) = 9568 numbers up to 11965 share no factor with it.
- 4
The digits of 11965 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11965 = 5 \times 2393 \]
11965 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14364 |
| Euler totient φ(n) | 9568 |
| Square | 143161225 |
| Cube | 1712924057125 |
| Square root | 109.384642 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1965 × |
11965 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and sixty-five |
| Binary (base 2) | 10111010111101 |
| Octal (base 8) | 27275 |
| Hexadecimal (base 16) | 2EBD |
| Base 3 | 121102011 |
| As time | 11965 seconds = 3 h 19 min 25 s |
Is 11965 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 | No (remainder 1) | 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 | Yes (11965 ÷ 5 = 2393) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11965 a prime number?
No. 11965 = 5 × 2393, so it is divisible by 5.
What are the factors of 11965?
1, 5, 2393, 11965.
What is 11965 in binary?
10111010111101 (hexadecimal 2EBD, octal 27275).
What is the square root of 11965?
About 109.3846.
Is 11965 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 11965?
11965 is a semiprime: 5 × 2393, the product of two primes.