The number 56592
56592 is a composite number with 40 divisors. Its prime factorisation is × × 131. Divisors (40): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72 … 56592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56592: a Harshad number: divisible by its digit sum 27.
- 2
56592 is composite. Its prime factorisation is
- 3
The divisors add up to 163680; without 56592 itself that is 107088, so 56592 is abundant (107088 is more than 56592). Euler's totient φ(56592) = 18720 numbers up to 56592 share no factor with it.
- 4
The digits of 56592 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56592 = 2^{4} \times 3^{3} \times 131 \]56592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 163680 |
| Euler totient φ(n) | 18720 |
| Square | 3202654464 |
| Cube | 181244621426688 |
| Square root | 237.890731 (= 12√393) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6592 × |
56592 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand five hundred and ninety-two |
| Binary (base 2) | 1101110100010000 |
| Octal (base 8) | 156420 |
| Hexadecimal (base 16) | DD10 |
| Base 3 | 2212122000 |
| As time | 56592 seconds = 15 h 43 min 12 s |
Is 56592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56592 ÷ 2 = 28296) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56592 ÷ 3 = 18864) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56592 ÷ 4 = 14148) | 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 | Yes (56592 ÷ 6 = 9432) | 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 (56592 ÷ 8 = 7074) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56592 ÷ 9 = 6288) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 (56592 ÷ 12 = 4716) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56592 a prime number?
No. 56592 = × × 131, so it is divisible by 2.
What are the factors of 56592?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72, 108, 131, 144, 216, 262, 393, 432, 524, 786, 1048, 1179, 1572, 2096, 2358, 3144, 3537, 4716, 6288, 7074, 9432, 14148, 18864, 28296, 56592.
What is 56592 in binary?
1101110100010000 (hexadecimal DD10, octal 156420).
What is the square root of 56592?
About 237.8907, exactly 12√393.
Is 56592 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56592?
56592 is a Harshad number: divisible by its digit sum 27.