The number 53568
53568 is a composite number with 56 divisors. Its prime factorisation is × × 31. Divisors (56): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 31, 32, 36, 48 … 53568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53568: a Harshad number: divisible by its digit sum 27.
- 2
53568 is composite. Its prime factorisation is
- 3
The divisors add up to 162560; without 53568 itself that is 108992, so 53568 is abundant (108992 is more than 53568). Euler's totient φ(53568) = 17280 numbers up to 53568 share no factor with it.
- 4
The digits of 53568 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53568 = 2^{6} \times 3^{3} \times 31 \]53568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 56 |
| Sum of divisors | 162560 |
| Euler totient φ(n) | 17280 |
| Square | 2869530624 |
| Cube | 153715016466432 |
| Square root | 231.447618 (= 24√93) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.3568 × |
53568 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and sixty-eight |
| Binary (base 2) | 1101000101000000 |
| Octal (base 8) | 150500 |
| Hexadecimal (base 16) | D140 |
| Base 3 | 2201111000 |
| As time | 53568 seconds = 14 h 52 min 48 s |
Is 53568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53568 ÷ 2 = 26784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53568 ÷ 3 = 17856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53568 ÷ 4 = 13392) | 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 (53568 ÷ 6 = 8928) | 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 (53568 ÷ 8 = 6696) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53568 ÷ 9 = 5952) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (53568 ÷ 12 = 4464) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53568 a prime number?
No. 53568 = × × 31, so it is divisible by 2.
What are the factors of 53568?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 31, 32, 36, 48, 54, 62, 64, 72, 93, 96, 108, 124, 144, 186, 192, 216, 248, 279, 288, 372, 432, 496, 558, 576, 744, 837, 864, 992, 1116, 1488, 1674, 1728, 1984, 2232, 2976, 3348, 4464, 5952, 6696, 8928, 13392, 17856, 26784, 53568.
What is 53568 in binary?
1101000101000000 (hexadecimal D140, octal 150500).
What is the square root of 53568?
About 231.4476, exactly 24√93.
Is 53568 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 53568?
53568 is a Harshad number: divisible by its digit sum 27.