The number 56110
56110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 31 × 181. Divisors (16): 1, 2, 5, 10, 31, 62, 155, 181, 310, 362, 905, 1810, 5611, 11222, 28055, 56110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56110 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56110 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 56110 itself that is 48722, so 56110 is deficient (48722 is less than 56110). Euler's totient φ(56110) = 21600 numbers up to 56110 share no factor with it.
- 4
The digits of 56110 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56110 = 2 \times 5 \times 31 \times 181 \]
56110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 21600 |
| Square | 3148332100 |
| Cube | 176652914131000 |
| Square root | 236.875495 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.611 × |
56110 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and ten |
| Binary (base 2) | 1101101100101110 |
| Octal (base 8) | 155456 |
| Hexadecimal (base 16) | DB2E |
| Base 3 | 2211222011 |
| As time | 56110 seconds = 15 h 35 min 10 s |
Is 56110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56110 ÷ 2 = 28055) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56110 ÷ 5 = 11222) | 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 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (56110 ÷ 10 = 5611) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56110 a prime number?
No. 56110 = 2 × 5 × 31 × 181, so it is divisible by 2.
What are the factors of 56110?
1, 2, 5, 10, 31, 62, 155, 181, 310, 362, 905, 1810, 5611, 11222, 28055, 56110.
What is 56110 in binary?
1101101100101110 (hexadecimal DB2E, octal 155456).
What is the square root of 56110?
About 236.8755.
Is 56110 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 56110?
It is a composite number with 16 divisors.