The number 32052
32052 is a composite number with 12 divisors. Its prime factorisation is × 3 × 2671. Divisors (12): 1, 2, 3, 4, 6, 12, 2671, 5342, 8013, 10684, 16026, 32052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32052: a Harshad number: divisible by its digit sum 12.
- 2
32052 is composite. Its prime factorisation is
- 3
The divisors add up to 74816; without 32052 itself that is 42764, so 32052 is abundant (42764 is more than 32052). Euler's totient φ(32052) = 10680 numbers up to 32052 share no factor with it.
- 4
The digits of 32052 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32052 = 2^{2} \times 3 \times 2671 \]32052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74816 |
| Euler totient φ(n) | 10680 |
| Square | 1027330704 |
| Cube | 32928003724608 |
| Square root | 179.030724 (= 2√8013) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.2052 × |
32052 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand and fifty-two |
| Binary (base 2) | 111110100110100 |
| Octal (base 8) | 76464 |
| Hexadecimal (base 16) | 7D34 |
| Base 3 | 1121222010 |
| As time | 32052 seconds = 8 h 54 min 12 s |
Is 32052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32052 ÷ 2 = 16026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32052 ÷ 3 = 10684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (32052 ÷ 4 = 8013) | 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 (32052 ÷ 6 = 5342) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (32052 ÷ 12 = 2671) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32052 a prime number?
No. 32052 = × 3 × 2671, so it is divisible by 2.
What are the factors of 32052?
1, 2, 3, 4, 6, 12, 2671, 5342, 8013, 10684, 16026, 32052.
What is 32052 in binary?
111110100110100 (hexadecimal 7D34, octal 76464).
What is the square root of 32052?
About 179.0307, exactly 2√8013.
Is 32052 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 32052?
32052 is a Harshad number: divisible by its digit sum 12.