The number 21962
21962 is a composite number with 8 divisors. Its prime factorisation is 2 × 79 × 139. Divisors (8): 1, 2, 79, 139, 158, 278, 10981, 21962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
21962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
21962 is composite. Its prime factorisation is
- 3
The divisors add up to 33600; without 21962 itself that is 11638, so 21962 is deficient (11638 is less than 21962). Euler's totient φ(21962) = 10764 numbers up to 21962 share no factor with it.
- 4
The digits of 21962 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 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21962 = 2 \times 79 \times 139 \]
21962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 33600 |
| Euler totient φ(n) | 10764 |
| Square | 482329444 |
| Cube | 10592919249128 |
| Square root | 148.195816 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 43 |
| Scientific notation | 2.1962 × |
21962 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand nine hundred and sixty-two |
| Binary (base 2) | 101010111001010 |
| Octal (base 8) | 52712 |
| Hexadecimal (base 16) | 55CA |
| Base 3 | 1010010102 |
| As time | 21962 seconds = 6 h 6 min 2 s |
Is 21962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (21962 ÷ 2 = 10981) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 21962 a prime number?
No. 21962 = 2 × 79 × 139, so it is divisible by 2.
What are the factors of 21962?
1, 2, 79, 139, 158, 278, 10981, 21962.
What is 21962 in binary?
101010111001010 (hexadecimal 55CA, octal 52712).
What is the square root of 21962?
About 148.1958.
Is 21962 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 21962?
It is a composite number with 8 divisors.