The number 32552
32552 is a composite number with 16 divisors. Its prime factorisation is × 13 × 313. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 313, 626, 1252, 2504, 4069, 8138, 16276, 32552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32552 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32552 is composite. Its prime factorisation is
- 3
The divisors add up to 65940; without 32552 itself that is 33388, so 32552 is abundant (33388 is more than 32552). Euler's totient φ(32552) = 14976 numbers up to 32552 share no factor with it.
- 4
The digits of 32552 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32552 = 2^{3} \times 13 \times 313 \]32552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 65940 |
| Euler totient φ(n) | 14976 |
| Square | 1059632704 |
| Cube | 34493163780608 |
| Square root | 180.421728 (= 2√8138) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.2552 × |
32552 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred and fifty-two |
| Binary (base 2) | 111111100101000 |
| Octal (base 8) | 77450 |
| Hexadecimal (base 16) | 7F28 |
| Base 3 | 1122122122 |
| As time | 32552 seconds = 9 h 2 min 32 s |
Is 32552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32552 ÷ 2 = 16276) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (32552 ÷ 4 = 8138) | 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 2) | 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 | Yes (32552 ÷ 8 = 4069) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32552 a prime number?
No. 32552 = × 13 × 313, so it is divisible by 2.
What are the factors of 32552?
1, 2, 4, 8, 13, 26, 52, 104, 313, 626, 1252, 2504, 4069, 8138, 16276, 32552.
What is 32552 in binary?
111111100101000 (hexadecimal 7F28, octal 77450).
What is the square root of 32552?
About 180.4217, exactly 2√8138.
Is 32552 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 32552?
It is a composite number with 16 divisors.