The number 20962
20962 is a composite number with 8 divisors. Its prime factorisation is 2 × 47 × 223. Divisors (8): 1, 2, 47, 94, 223, 446, 10481, 20962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20962 is composite. Its prime factorisation is
- 3
The divisors add up to 32256; without 20962 itself that is 11294, so 20962 is deficient (11294 is less than 20962). Euler's totient φ(20962) = 10212 numbers up to 20962 share no factor with it.
- 4
The digits of 20962 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 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20962 = 2 \times 47 \times 223 \]
20962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32256 |
| Euler totient φ(n) | 10212 |
| Square | 439405444 |
| Cube | 9210816917128 |
| Square root | 144.782596 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0962 × |
20962 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and sixty-two |
| Binary (base 2) | 101000111100010 |
| Octal (base 8) | 50742 |
| Hexadecimal (base 16) | 51E2 |
| Base 3 | 1001202101 |
| As time | 20962 seconds = 5 h 49 min 22 s |
Is 20962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20962 ÷ 2 = 10481) | 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 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 | 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 7) | 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 20962 a prime number?
No. 20962 = 2 × 47 × 223, so it is divisible by 2.
What are the factors of 20962?
1, 2, 47, 94, 223, 446, 10481, 20962.
What is 20962 in binary?
101000111100010 (hexadecimal 51E2, octal 50742).
What is the square root of 20962?
About 144.7826.
Is 20962 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 20962?
It is a composite number with 8 divisors.