The number 5568
5568 is a composite number with 28 divisors. Its prime factorisation is × 3 × 29. Divisors (28): 1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96 … 5568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5568: a Harshad number: divisible by its digit sum 24.
- 2
5568 is composite. Its prime factorisation is
- 3
The divisors add up to 15240; without 5568 itself that is 9672, so 5568 is abundant (9672 is more than 5568). Euler's totient φ(5568) = 1792 numbers up to 5568 share no factor with it.
- 4
The digits of 5568 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 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5568 = 2^{6} \times 3 \times 29 \]5568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 15240 |
| Euler totient φ(n) | 1792 |
| Square | 31002624 |
| Cube | 172622610432 |
| Square root | 74.619032 (= 8√87) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.568 × |
5568 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and sixty-eight |
| Binary (base 2) | 1010111000000 |
| Octal (base 8) | 12700 |
| Hexadecimal (base 16) | 15C0 |
| Base 3 | 21122020 |
| As time | 5568 seconds = 1 h 32 min 48 s |
Is 5568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5568 ÷ 2 = 2784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5568 ÷ 3 = 1856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5568 ÷ 4 = 1392) | 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 (5568 ÷ 6 = 928) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (5568 ÷ 8 = 696) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5568 ÷ 12 = 464) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5568 a prime number?
No. 5568 = × 3 × 29, so it is divisible by 2.
What are the factors of 5568?
1, 2, 3, 4, 6, 8, 12, 16, 24, 29, 32, 48, 58, 64, 87, 96, 116, 174, 192, 232, 348, 464, 696, 928, 1392, 1856, 2784, 5568.
What is 5568 in binary?
1010111000000 (hexadecimal 15C0, octal 12700).
What is the square root of 5568?
About 74.6190, exactly 8√87.
Is 5568 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 5568?
5568 is a Harshad number: divisible by its digit sum 24.