The number 27568
27568 is a composite number with 10 divisors. Its prime factorisation is × 1723. Divisors (10): 1, 2, 4, 8, 16, 1723, 3446, 6892, 13784, 27568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
27568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
27568 is composite. Its prime factorisation is
- 3
The divisors add up to 53444; without 27568 itself that is 25876, so 27568 is deficient (25876 is less than 27568). Euler's totient φ(27568) = 13776 numbers up to 27568 share no factor with it.
- 4
The digits of 27568 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27568 = 2^{4} \times 1723 \]27568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 53444 |
| Euler totient φ(n) | 13776 |
| Square | 759994624 |
| Cube | 20951531794432 |
| Square root | 166.036141 (= 4√1723) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 59 |
| Scientific notation | 2.7568 × |
27568 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand five hundred and sixty-eight |
| Binary (base 2) | 110101110110000 |
| Octal (base 8) | 65660 |
| Hexadecimal (base 16) | 6BB0 |
| Base 3 | 1101211001 |
| As time | 27568 seconds = 7 h 39 min 28 s |
Is 27568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27568 ÷ 2 = 13784) | 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 (27568 ÷ 4 = 6892) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (27568 ÷ 8 = 3446) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 2) | 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 27568 a prime number?
No. 27568 = × 1723, so it is divisible by 2.
What are the factors of 27568?
1, 2, 4, 8, 16, 1723, 3446, 6892, 13784, 27568.
What is 27568 in binary?
110101110110000 (hexadecimal 6BB0, octal 65660).
What is the square root of 27568?
About 166.0361, exactly 4√1723.
Is 27568 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 27568?
It is a composite number with 10 divisors.