The number 20952
20952 is a composite number with 32 divisors. Its prime factorisation is × × 97. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 97, 108 … 20952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20952: a Harshad number: divisible by its digit sum 18.
- 2
20952 is composite. Its prime factorisation is
- 3
The divisors add up to 58800; without 20952 itself that is 37848, so 20952 is abundant (37848 is more than 20952). Euler's totient φ(20952) = 6912 numbers up to 20952 share no factor with it.
- 4
The digits of 20952 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 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20952 = 2^{3} \times 3^{3} \times 97 \]20952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 58800 |
| Euler totient φ(n) | 6912 |
| Square | 438986304 |
| Cube | 9197641041408 |
| Square root | 144.748057 (= 6√582) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 105 |
| Scientific notation | 2.0952 × |
20952 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and fifty-two |
| Binary (base 2) | 101000111011000 |
| Octal (base 8) | 50730 |
| Hexadecimal (base 16) | 51D8 |
| Base 3 | 1001202000 |
| As time | 20952 seconds = 5 h 49 min 12 s |
Is 20952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20952 ÷ 2 = 10476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20952 ÷ 3 = 6984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (20952 ÷ 4 = 5238) | 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 | Yes (20952 ÷ 6 = 3492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (20952 ÷ 8 = 2619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (20952 ÷ 9 = 2328) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (20952 ÷ 12 = 1746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20952 a prime number?
No. 20952 = × × 97, so it is divisible by 2.
What are the factors of 20952?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 97, 108, 194, 216, 291, 388, 582, 776, 873, 1164, 1746, 2328, 2619, 3492, 5238, 6984, 10476, 20952.
What is 20952 in binary?
101000111011000 (hexadecimal 51D8, octal 50730).
What is the square root of 20952?
About 144.7481, exactly 6√582.
Is 20952 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 20952?
20952 is a Harshad number: divisible by its digit sum 18.