The number 5190
5190 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 173. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 173, 346, 519, 865, 1038, 1730, 2595, 5190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5190: a Harshad number: divisible by its digit sum 15.
- 2
5190 is composite. Its prime factorisation is
- 3
The divisors add up to 12528; without 5190 itself that is 7338, so 5190 is abundant (7338 is more than 5190). Euler's totient φ(5190) = 1376 numbers up to 5190 share no factor with it.
- 4
The digits of 5190 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5190 = 2 \times 3 \times 5 \times 173 \]
5190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12528 |
| Euler totient φ(n) | 1376 |
| Square | 26936100 |
| Cube | 139798359000 |
| Square root | 72.041655 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 103 |
| Scientific notation | 5.19 × |
5190 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and ninety |
| Binary (base 2) | 1010001000110 |
| Octal (base 8) | 12106 |
| Hexadecimal (base 16) | 1446 |
| Base 3 | 21010020 |
| As time | 5190 seconds = 1 h 26 min 30 s |
Is 5190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5190 ÷ 2 = 2595) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5190 ÷ 3 = 1730) | 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 (5190 ÷ 5 = 1038) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5190 ÷ 6 = 865) | 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 | No (remainder 6) | 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 | Yes (5190 ÷ 10 = 519) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5190 a prime number?
No. 5190 = 2 × 3 × 5 × 173, so it is divisible by 2.
What are the factors of 5190?
1, 2, 3, 5, 6, 10, 15, 30, 173, 346, 519, 865, 1038, 1730, 2595, 5190.
What is 5190 in binary?
1010001000110 (hexadecimal 1446, octal 12106).
What is the square root of 5190?
About 72.0417.
Is 5190 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5190?
5190 is a Harshad number: divisible by its digit sum 15.