The number 20963
20963 is the 2358th prime number. Its only divisors are 1 and 20963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20963: the 2358th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
20963 is prime, so its only factors are 1 and 20963. It is the 2358th prime; the next prime is 20981 and the one before is 20959.
- 3
The divisors add up to 20964; without 20963 itself that is 1, so 20963 is deficient (1 is less than 20963). Euler's totient φ(20963) = 20962 numbers up to 20963 share no factor with it.
- 4
The digits of 20963 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 149 steps to reach 1.
20963 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 20964 |
| Euler totient φ(n) | 20962 |
| Square | 439447369 |
| Cube | 9212135196347 |
| Square root | 144.786049 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0963 × |
20963 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and sixty-three |
| Binary (base 2) | 101000111100011 |
| Octal (base 8) | 50743 |
| Hexadecimal (base 16) | 51E3 |
| Base 3 | 1001202102 |
| As time | 20963 seconds = 5 h 49 min 23 s |
Is 20963 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 | No (remainder 5) | 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 8) | 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 20963 a prime number?
Yes. 20963 is divisible only by 1 and itself.
What are the factors of 20963?
1, 20963.
What is 20963 in binary?
101000111100011 (hexadecimal 51E3, octal 50743).
What is the square root of 20963?
About 144.7860.
Is 20963 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 20963?
20963 is the 2358th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.