The number 32560
32560 is a composite number with 40 divisors. Its prime factorisation is × 5 × 11 × 37. Divisors (40): 1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 37, 40, 44, 55, 74, 80 … 32560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32560: a Harshad number: divisible by its digit sum 16.
- 2
32560 is composite. Its prime factorisation is
- 3
The divisors add up to 84816; without 32560 itself that is 52256, so 32560 is abundant (52256 is more than 32560). Euler's totient φ(32560) = 11520 numbers up to 32560 share no factor with it.
- 4
The digits of 32560 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32560 = 2^{4} \times 5 \times 11 \times 37 \]32560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 84816 |
| Euler totient φ(n) | 11520 |
| Square | 1060153600 |
| Cube | 34518601216000 |
| Square root | 180.443897 (= 4√2035) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.256 × |
32560 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred and sixty |
| Binary (base 2) | 111111100110000 |
| Octal (base 8) | 77460 |
| Hexadecimal (base 16) | 7F30 |
| Base 3 | 1122122221 |
| As time | 32560 seconds = 9 h 2 min 40 s |
Is 32560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32560 ÷ 2 = 16280) | 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 (32560 ÷ 4 = 8140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32560 ÷ 5 = 6512) | 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 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 | Yes (32560 ÷ 8 = 4070) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32560 ÷ 10 = 3256) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (32560 ÷ 11 = 2960) | 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 32560 a prime number?
No. 32560 = × 5 × 11 × 37, so it is divisible by 2.
What are the factors of 32560?
1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 37, 40, 44, 55, 74, 80, 88, 110, 148, 176, 185, 220, 296, 370, 407, 440, 592, 740, 814, 880, 1480, 1628, 2035, 2960, 3256, 4070, 6512, 8140, 16280, 32560.
What is 32560 in binary?
111111100110000 (hexadecimal 7F30, octal 77460).
What is the square root of 32560?
About 180.4439, exactly 4√2035.
Is 32560 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 32560?
32560 is a Harshad number: divisible by its digit sum 16.