The number 52568
52568 is a composite number with 8 divisors. Its prime factorisation is × 6571. Divisors (8): 1, 2, 4, 8, 6571, 13142, 26284, 52568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52568 is composite. Its prime factorisation is
- 3
The divisors add up to 98580; without 52568 itself that is 46012, so 52568 is deficient (46012 is less than 52568). Euler's totient φ(52568) = 26280 numbers up to 52568 share no factor with it.
- 4
The digits of 52568 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52568 = 2^{3} \times 6571 \]52568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98580 |
| Euler totient φ(n) | 26280 |
| Square | 2763394624 |
| Cube | 145266128594432 |
| Square root | 229.277125 (= 2√13142) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.2568 × |
52568 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and sixty-eight |
| Binary (base 2) | 1100110101011000 |
| Octal (base 8) | 146530 |
| Hexadecimal (base 16) | CD58 |
| Base 3 | 2200002222 |
| As time | 52568 seconds = 14 h 36 min 8 s |
Is 52568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52568 ÷ 2 = 26284) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52568 ÷ 4 = 13142) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (52568 ÷ 8 = 6571) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52568 a prime number?
No. 52568 = × 6571, so it is divisible by 2.
What are the factors of 52568?
1, 2, 4, 8, 6571, 13142, 26284, 52568.
What is 52568 in binary?
1100110101011000 (hexadecimal CD58, octal 146530).
What is the square root of 52568?
About 229.2771, exactly 2√13142.
Is 52568 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 52568?
It is a composite number with 8 divisors.