The number 20951
20951 is a composite number with 8 divisors. Its prime factorisation is 7 × 41 × 73. Divisors (8): 1, 7, 41, 73, 287, 511, 2993, 20951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20951 is composite. Its prime factorisation is
- 3
The divisors add up to 24864; without 20951 itself that is 3913, so 20951 is deficient (3913 is less than 20951). Euler's totient φ(20951) = 17280 numbers up to 20951 share no factor with it.
- 4
The digits of 20951 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20951 = 7 \times 41 \times 73 \]
20951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24864 |
| Euler totient φ(n) | 17280 |
| Square | 438944401 |
| Cube | 9196324145351 |
| Square root | 144.744603 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0951 × |
20951 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and fifty-one |
| Binary (base 2) | 101000111010111 |
| Octal (base 8) | 50727 |
| Hexadecimal (base 16) | 51D7 |
| Base 3 | 1001201222 |
| As time | 20951 seconds = 5 h 49 min 11 s |
Is 20951 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 1) | 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 (20951 ÷ 7 = 2993) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20951 a prime number?
No. 20951 = 7 × 41 × 73, so it is divisible by 7.
What are the factors of 20951?
1, 7, 41, 73, 287, 511, 2993, 20951.
What is 20951 in binary?
101000111010111 (hexadecimal 51D7, octal 50727).
What is the square root of 20951?
About 144.7446.
Is 20951 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 20951?
It is a composite number with 8 divisors.