The number 32565
32565 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 167. Divisors (16): 1, 3, 5, 13, 15, 39, 65, 167, 195, 501, 835, 2171, 2505, 6513, 10855, 32565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32565 is composite. Its prime factorisation is
- 3
The divisors add up to 56448; without 32565 itself that is 23883, so 32565 is deficient (23883 is less than 32565). Euler's totient φ(32565) = 15936 numbers up to 32565 share no factor with it.
- 4
The digits of 32565 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32565 = 3 \times 5 \times 13 \times 167 \]
32565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 56448 |
| Euler totient φ(n) | 15936 |
| Square | 1060479225 |
| Cube | 34534505962125 |
| Square root | 180.457751 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.2565 × |
32565 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred and sixty-five |
| Binary (base 2) | 111111100110101 |
| Octal (base 8) | 77465 |
| Hexadecimal (base 16) | 7F35 |
| Base 3 | 1122200010 |
| As time | 32565 seconds = 9 h 2 min 45 s |
Is 32565 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 | Yes (32565 ÷ 3 = 10855) | 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 (32565 ÷ 5 = 6513) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | 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 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32565 a prime number?
No. 32565 = 3 × 5 × 13 × 167, so it is divisible by 3.
What are the factors of 32565?
1, 3, 5, 13, 15, 39, 65, 167, 195, 501, 835, 2171, 2505, 6513, 10855, 32565.
What is 32565 in binary?
111111100110101 (hexadecimal 7F35, octal 77465).
What is the square root of 32565?
About 180.4578.
Is 32565 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 32565?
It is a composite number with 16 divisors.