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