The number 32568
32568 is a composite number with 32 divisors. Its prime factorisation is × 3 × 23 × 59. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 23, 24, 46, 59, 69, 92, 118, 138, 177 … 32568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32568: a Harshad number: divisible by its digit sum 24.
- 2
32568 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 32568 itself that is 53832, so 32568 is abundant (53832 is more than 32568). Euler's totient φ(32568) = 10208 numbers up to 32568 share no factor with it.
- 4
The digits of 32568 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32568 = 2^{3} \times 3 \times 23 \times 59 \]32568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 10208 |
| Square | 1060674624 |
| Cube | 34544051154432 |
| Square root | 180.466063 (= 2√8142) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.2568 × |
32568 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred and sixty-eight |
| Binary (base 2) | 111111100111000 |
| Octal (base 8) | 77470 |
| Hexadecimal (base 16) | 7F38 |
| Base 3 | 1122200020 |
| As time | 32568 seconds = 9 h 2 min 48 s |
Is 32568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32568 ÷ 2 = 16284) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32568 ÷ 3 = 10856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (32568 ÷ 4 = 8142) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (32568 ÷ 6 = 5428) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (32568 ÷ 8 = 4071) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (32568 ÷ 12 = 2714) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32568 a prime number?
No. 32568 = × 3 × 23 × 59, so it is divisible by 2.
What are the factors of 32568?
1, 2, 3, 4, 6, 8, 12, 23, 24, 46, 59, 69, 92, 118, 138, 177, 184, 236, 276, 354, 472, 552, 708, 1357, 1416, 2714, 4071, 5428, 8142, 10856, 16284, 32568.
What is 32568 in binary?
111111100111000 (hexadecimal 7F38, octal 77470).
What is the square root of 32568?
About 180.4661, exactly 2√8142.
Is 32568 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 32568?
32568 is a Harshad number: divisible by its digit sum 24.