The number 32705
32705 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 211. Divisors (8): 1, 5, 31, 155, 211, 1055, 6541, 32705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32705 is composite. Its prime factorisation is
- 3
The divisors add up to 40704; without 32705 itself that is 7999, so 32705 is deficient (7999 is less than 32705). Euler's totient φ(32705) = 25200 numbers up to 32705 share no factor with it.
- 4
The digits of 32705 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
\[ 32705 = 5 \times 31 \times 211 \]
32705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 40704 |
| Euler totient φ(n) | 25200 |
| Square | 1069617025 |
| Cube | 34981824802625 |
| Square root | 180.845238 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.2705 × |
32705 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand seven hundred and five |
| Binary (base 2) | 111111111000001 |
| Octal (base 8) | 77701 |
| Hexadecimal (base 16) | 7FC1 |
| Base 3 | 1122212022 |
| As time | 32705 seconds = 9 h 5 min 5 s |
Is 32705 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32705 ÷ 5 = 6541) | 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 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 | No (remainder 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32705 a prime number?
No. 32705 = 5 × 31 × 211, so it is divisible by 5.
What are the factors of 32705?
1, 5, 31, 155, 211, 1055, 6541, 32705.
What is 32705 in binary?
111111111000001 (hexadecimal 7FC1, octal 77701).
What is the square root of 32705?
About 180.8452.
Is 32705 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 32705?
It is a composite number with 8 divisors.