The number 5130
5130 is a composite number with 32 divisors. Its prime factorisation is 2 × × 5 × 19. Divisors (32): 1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 27, 30, 38, 45, 54, 57 … 5130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5130: a Harshad number: divisible by its digit sum 9.
- 2
5130 is composite. Its prime factorisation is
- 3
The divisors add up to 14400; without 5130 itself that is 9270, so 5130 is abundant (9270 is more than 5130). Euler's totient φ(5130) = 1296 numbers up to 5130 share no factor with it.
- 4
The digits of 5130 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5130 = 2 \times 3^{3} \times 5 \times 19 \]5130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 14400 |
| Euler totient φ(n) | 1296 |
| Square | 26316900 |
| Cube | 135005697000 |
| Square root | 71.624018 (= 3√570) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.13 × |
5130 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and thirty |
| Binary (base 2) | 1010000001010 |
| Octal (base 8) | 12012 |
| Hexadecimal (base 16) | 140A |
| Base 3 | 21001000 |
| As time | 5130 seconds = 1 h 25 min 30 s |
Is 5130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5130 ÷ 2 = 2565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5130 ÷ 3 = 1710) | 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 (5130 ÷ 5 = 1026) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5130 ÷ 6 = 855) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5130 ÷ 9 = 570) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5130 ÷ 10 = 513) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 5130 a prime number?
No. 5130 = 2 × × 5 × 19, so it is divisible by 2.
What are the factors of 5130?
1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 27, 30, 38, 45, 54, 57, 90, 95, 114, 135, 171, 190, 270, 285, 342, 513, 570, 855, 1026, 1710, 2565, 5130.
What is 5130 in binary?
1010000001010 (hexadecimal 140A, octal 12012).
What is the square root of 5130?
About 71.6240, exactly 3√570.
Is 5130 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 5130?
5130 is a Harshad number: divisible by its digit sum 9.