The number 5110
5110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 73. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 73, 146, 365, 511, 730, 1022, 2555, 5110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5110: a Harshad number: divisible by its digit sum 7.
- 2
5110 is composite. Its prime factorisation is
- 3
The divisors add up to 10656; without 5110 itself that is 5546, so 5110 is abundant (5546 is more than 5110). Euler's totient φ(5110) = 1728 numbers up to 5110 share no factor with it.
- 4
The digits of 5110 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5110 = 2 \times 5 \times 7 \times 73 \]
5110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 10656 |
| Euler totient φ(n) | 1728 |
| Square | 26112100 |
| Cube | 133432831000 |
| Square root | 71.484264 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 59 |
| Scientific notation | 5.11 × |
5110 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and ten |
| Binary (base 2) | 1001111110110 |
| Octal (base 8) | 11766 |
| Hexadecimal (base 16) | 13F6 |
| Base 3 | 21000021 |
| As time | 5110 seconds = 1 h 25 min 10 s |
Is 5110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5110 ÷ 2 = 2555) | 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 (5110 ÷ 5 = 1022) | 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 | Yes (5110 ÷ 7 = 730) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5110 ÷ 10 = 511) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 5110 a prime number?
No. 5110 = 2 × 5 × 7 × 73, so it is divisible by 2.
What are the factors of 5110?
1, 2, 5, 7, 10, 14, 35, 70, 73, 146, 365, 511, 730, 1022, 2555, 5110.
What is 5110 in binary?
1001111110110 (hexadecimal 13F6, octal 11766).
What is the square root of 5110?
About 71.4843.
Is 5110 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 5110?
5110 is a Harshad number: divisible by its digit sum 7.