The number 32952
32952 is a composite number with 16 divisors. Its prime factorisation is × 3 × 1373. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 1373, 2746, 4119, 5492, 8238, 10984, 16476, 32952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32952 is composite. Its prime factorisation is
- 3
The divisors add up to 82440; without 32952 itself that is 49488, so 32952 is abundant (49488 is more than 32952). Euler's totient φ(32952) = 10976 numbers up to 32952 share no factor with it.
- 4
The digits of 32952 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32952 = 2^{3} \times 3 \times 1373 \]32952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82440 |
| Euler totient φ(n) | 10976 |
| Square | 1085834304 |
| Cube | 35780411985408 |
| Square root | 181.526858 (= 2√8238) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.2952 × |
32952 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and fifty-two |
| Binary (base 2) | 1000000010111000 |
| Octal (base 8) | 100270 |
| Hexadecimal (base 16) | 80B8 |
| Base 3 | 1200012110 |
| As time | 32952 seconds = 9 h 9 min 12 s |
Is 32952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32952 ÷ 2 = 16476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32952 ÷ 3 = 10984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (32952 ÷ 4 = 8238) | 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 (32952 ÷ 6 = 5492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (32952 ÷ 8 = 4119) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (32952 ÷ 12 = 2746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32952 a prime number?
No. 32952 = × 3 × 1373, so it is divisible by 2.
What are the factors of 32952?
1, 2, 3, 4, 6, 8, 12, 24, 1373, 2746, 4119, 5492, 8238, 10984, 16476, 32952.
What is 32952 in binary?
1000000010111000 (hexadecimal 80B8, octal 100270).
What is the square root of 32952?
About 181.5269, exactly 2√8238.
Is 32952 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 32952?
It is a composite number with 16 divisors.