The number 21951
21951 is a composite number with 10 divisors. Its prime factorisation is × 271. Divisors (10): 1, 3, 9, 27, 81, 271, 813, 2439, 7317, 21951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
21951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
21951 is composite. Its prime factorisation is
- 3
The divisors add up to 32912; without 21951 itself that is 10961, so 21951 is deficient (10961 is less than 21951). Euler's totient φ(21951) = 14580 numbers up to 21951 share no factor with it.
- 4
The digits of 21951 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 100 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21951 = 3^{4} \times 271 \]21951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 32912 |
| Euler totient φ(n) | 14580 |
| Square | 481846401 |
| Cube | 10577010348351 |
| Square root | 148.158699 (= 9√271) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 100 |
| Scientific notation | 2.1951 × |
21951 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand nine hundred and fifty-one |
| Binary (base 2) | 101010110111111 |
| Octal (base 8) | 52677 |
| Hexadecimal (base 16) | 55BF |
| Base 3 | 1010010000 |
| As time | 21951 seconds = 6 h 5 min 51 s |
Is 21951 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 | Yes (21951 ÷ 3 = 7317) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (21951 ÷ 9 = 2439) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 21951 a prime number?
No. 21951 = × 271, so it is divisible by 3.
What are the factors of 21951?
1, 3, 9, 27, 81, 271, 813, 2439, 7317, 21951.
What is 21951 in binary?
101010110111111 (hexadecimal 55BF, octal 52677).
What is the square root of 21951?
About 148.1587, exactly 9√271.
Is 21951 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 21951?
It is a composite number with 10 divisors.