The number 55568
55568 is a composite number with 20 divisors. Its prime factorisation is × 23 × 151. Divisors (20): 1, 2, 4, 8, 16, 23, 46, 92, 151, 184, 302, 368, 604, 1208, 2416, 3473 … 55568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55568 is composite. Its prime factorisation is
- 3
The divisors add up to 113088; without 55568 itself that is 57520, so 55568 is abundant (57520 is more than 55568). Euler's totient φ(55568) = 26400 numbers up to 55568 share no factor with it.
- 4
The digits of 55568 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55568 = 2^{4} \times 23 \times 151 \]55568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 113088 |
| Euler totient φ(n) | 26400 |
| Square | 3087802624 |
| Cube | 171583016210432 |
| Square root | 235.728658 (= 4√3473) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5568 × |
55568 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and sixty-eight |
| Binary (base 2) | 1101100100010000 |
| Octal (base 8) | 154420 |
| Hexadecimal (base 16) | D910 |
| Base 3 | 2211020002 |
| As time | 55568 seconds = 15 h 26 min 8 s |
Is 55568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55568 ÷ 2 = 27784) | 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 (55568 ÷ 4 = 13892) | 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 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 (55568 ÷ 8 = 6946) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | 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 55568 a prime number?
No. 55568 = × 23 × 151, so it is divisible by 2.
What are the factors of 55568?
1, 2, 4, 8, 16, 23, 46, 92, 151, 184, 302, 368, 604, 1208, 2416, 3473, 6946, 13892, 27784, 55568.
What is 55568 in binary?
1101100100010000 (hexadecimal D910, octal 154420).
What is the square root of 55568?
About 235.7287, exactly 4√3473.
Is 55568 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55568?
It is a composite number with 20 divisors.