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