The number 20032
20032 is a composite number with 14 divisors. Its prime factorisation is × 313. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 313, 626, 1252, 2504, 5008, 10016, 20032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20032 is composite. Its prime factorisation is
- 3
The divisors add up to 39878; without 20032 itself that is 19846, so 20032 is deficient (19846 is less than 20032). Euler's totient φ(20032) = 9984 numbers up to 20032 share no factor with it.
- 4
The digits of 20032 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20032 = 2^{6} \times 313 \]20032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 39878 |
| Euler totient φ(n) | 9984 |
| Square | 401281024 |
| Cube | 8038461472768 |
| Square root | 141.534448 (= 8√313) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0032 × |
20032 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and thirty-two |
| Binary (base 2) | 100111001000000 |
| Octal (base 8) | 47100 |
| Hexadecimal (base 16) | 4E40 |
| Base 3 | 1000110221 |
| As time | 20032 seconds = 5 h 33 min 52 s |
Is 20032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20032 ÷ 2 = 10016) | 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 (20032 ÷ 4 = 5008) | 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 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 | Yes (20032 ÷ 8 = 2504) | 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 1) | 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 20032 a prime number?
No. 20032 = × 313, so it is divisible by 2.
What are the factors of 20032?
1, 2, 4, 8, 16, 32, 64, 313, 626, 1252, 2504, 5008, 10016, 20032.
What is 20032 in binary?
100111001000000 (hexadecimal 4E40, octal 47100).
What is the square root of 20032?
About 141.5344, exactly 8√313.
Is 20032 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 20032?
It is a composite number with 14 divisors.