The number 32992
32992 is a composite number with 12 divisors. Its prime factorisation is × 1031. Divisors (12): 1, 2, 4, 8, 16, 32, 1031, 2062, 4124, 8248, 16496, 32992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32992 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32992 is composite. Its prime factorisation is
- 3
The divisors add up to 65016; without 32992 itself that is 32024, so 32992 is deficient (32024 is less than 32992). Euler's totient φ(32992) = 16480 numbers up to 32992 share no factor with it.
- 4
The digits of 32992 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32992 = 2^{5} \times 1031 \]32992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 65016 |
| Euler totient φ(n) | 16480 |
| Square | 1088472064 |
| Cube | 35910870335488 |
| Square root | 181.637001 (= 4√2062) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.2992 × |
32992 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and ninety-two |
| Binary (base 2) | 1000000011100000 |
| Octal (base 8) | 100340 |
| Hexadecimal (base 16) | 80E0 |
| Base 3 | 1200020221 |
| As time | 32992 seconds = 9 h 9 min 52 s |
Is 32992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32992 ÷ 2 = 16496) | 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 (32992 ÷ 4 = 8248) | 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 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 (32992 ÷ 8 = 4124) | 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 3) | 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 32992 a prime number?
No. 32992 = × 1031, so it is divisible by 2.
What are the factors of 32992?
1, 2, 4, 8, 16, 32, 1031, 2062, 4124, 8248, 16496, 32992.
What is 32992 in binary?
1000000011100000 (hexadecimal 80E0, octal 100340).
What is the square root of 32992?
About 181.6370, exactly 4√2062.
Is 32992 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 32992?
It is a composite number with 12 divisors.