The number 32152
32152 is a composite number with 8 divisors. Its prime factorisation is × 4019. Divisors (8): 1, 2, 4, 8, 4019, 8038, 16076, 32152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32152 is composite. Its prime factorisation is
- 3
The divisors add up to 60300; without 32152 itself that is 28148, so 32152 is deficient (28148 is less than 32152). Euler's totient φ(32152) = 16072 numbers up to 32152 share no factor with it.
- 4
The digits of 32152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32152 = 2^{3} \times 4019 \]32152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60300 |
| Euler totient φ(n) | 16072 |
| Square | 1033751104 |
| Cube | 33237165495808 |
| Square root | 179.309788 (= 2√8038) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 28 |
| Scientific notation | 3.2152 × |
32152 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and fifty-two |
| Binary (base 2) | 111110110011000 |
| Octal (base 8) | 76630 |
| Hexadecimal (base 16) | 7D98 |
| Base 3 | 1122002211 |
| As time | 32152 seconds = 8 h 55 min 52 s |
Is 32152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32152 ÷ 2 = 16076) | 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 (32152 ÷ 4 = 8038) | 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 (32152 ÷ 8 = 4019) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | 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 32152 a prime number?
No. 32152 = × 4019, so it is divisible by 2.
What are the factors of 32152?
1, 2, 4, 8, 4019, 8038, 16076, 32152.
What is 32152 in binary?
111110110011000 (hexadecimal 7D98, octal 76630).
What is the square root of 32152?
About 179.3098, exactly 2√8038.
Is 32152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 32152?
It is a composite number with 8 divisors.