The number 53110
53110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 47 × 113. Divisors (16): 1, 2, 5, 10, 47, 94, 113, 226, 235, 470, 565, 1130, 5311, 10622, 26555, 53110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53110: a Harshad number: divisible by its digit sum 10.
- 2
53110 is composite. Its prime factorisation is
- 3
The divisors add up to 98496; without 53110 itself that is 45386, so 53110 is deficient (45386 is less than 53110). Euler's totient φ(53110) = 20608 numbers up to 53110 share no factor with it.
- 4
The digits of 53110 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53110 = 2 \times 5 \times 47 \times 113 \]
53110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98496 |
| Euler totient φ(n) | 20608 |
| Square | 2820672100 |
| Cube | 149805895231000 |
| Square root | 230.456070 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.311 × |
53110 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and ten |
| Binary (base 2) | 1100111101110110 |
| Octal (base 8) | 147566 |
| Hexadecimal (base 16) | CF76 |
| Base 3 | 2200212001 |
| As time | 53110 seconds = 14 h 45 min 10 s |
Is 53110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53110 ÷ 2 = 26555) | 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 (53110 ÷ 5 = 10622) | 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 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53110 ÷ 10 = 5311) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53110 a prime number?
No. 53110 = 2 × 5 × 47 × 113, so it is divisible by 2.
What are the factors of 53110?
1, 2, 5, 10, 47, 94, 113, 226, 235, 470, 565, 1130, 5311, 10622, 26555, 53110.
What is 53110 in binary?
1100111101110110 (hexadecimal CF76, octal 147566).
What is the square root of 53110?
About 230.4561.
Is 53110 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 53110?
53110 is a Harshad number: divisible by its digit sum 10.