The number 32147
32147 is a composite number with 8 divisors. Its prime factorisation is 17 × 31 × 61. Divisors (8): 1, 17, 31, 61, 527, 1037, 1891, 32147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32147: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
32147 is composite. Its prime factorisation is
- 3
The divisors add up to 35712; without 32147 itself that is 3565, so 32147 is deficient (3565 is less than 32147). Euler's totient φ(32147) = 28800 numbers up to 32147 share no factor with it.
- 4
The digits of 32147 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 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32147 = 17 \times 31 \times 61 \]
32147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 35712 |
| Euler totient φ(n) | 28800 |
| Square | 1033429609 |
| Cube | 33221661640523 |
| Square root | 179.295845 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 191 |
| Scientific notation | 3.2147 × |
32147 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and forty-seven |
| Binary (base 2) | 111110110010011 |
| Octal (base 8) | 76623 |
| Hexadecimal (base 16) | 7D93 |
| Base 3 | 1122002122 |
| As time | 32147 seconds = 8 h 55 min 47 s |
Is 32147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | 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 5) | 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 | No (remainder 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32147 a prime number?
No. 32147 = 17 × 31 × 61, so it is divisible by 17.
What are the factors of 32147?
1, 17, 31, 61, 527, 1037, 1891, 32147.
What is 32147 in binary?
111110110010011 (hexadecimal 7D93, octal 76623).
What is the square root of 32147?
About 179.2958.
Is 32147 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 32147?
32147 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.