The number 20932
20932 is a composite number with 6 divisors. Its prime factorisation is × 5233. Divisors (6): 1, 2, 4, 5233, 10466, 20932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20932 is composite. Its prime factorisation is
- 3
The divisors add up to 36638; without 20932 itself that is 15706, so 20932 is deficient (15706 is less than 20932). Euler's totient φ(20932) = 10464 numbers up to 20932 share no factor with it.
- 4
The digits of 20932 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 30 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20932 = 2^{2} \times 5233 \]20932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 36638 |
| Euler totient φ(n) | 10464 |
| Square | 438148624 |
| Cube | 9171326997568 |
| Square root | 144.678955 (= 2√5233) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 30 |
| Scientific notation | 2.0932 × |
20932 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and thirty-two |
| Binary (base 2) | 101000111000100 |
| Octal (base 8) | 50704 |
| Hexadecimal (base 16) | 51C4 |
| Base 3 | 1001201021 |
| As time | 20932 seconds = 5 h 48 min 52 s |
Is 20932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20932 ÷ 2 = 10466) | 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 | Yes (20932 ÷ 4 = 5233) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20932 a prime number?
No. 20932 = × 5233, so it is divisible by 2.
What are the factors of 20932?
1, 2, 4, 5233, 10466, 20932.
What is 20932 in binary?
101000111000100 (hexadecimal 51C4, octal 50704).
What is the square root of 20932?
About 144.6790, exactly 2√5233.
Is 20932 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 20932?
It is a composite number with 6 divisors.