The number 6130
6130 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 613. Divisors (8): 1, 2, 5, 10, 613, 1226, 3065, 6130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6130: a Harshad number: divisible by its digit sum 10.
- 2
6130 is composite. Its prime factorisation is
- 3
The divisors add up to 11052; without 6130 itself that is 4922, so 6130 is deficient (4922 is less than 6130). Euler's totient φ(6130) = 2448 numbers up to 6130 share no factor with it.
- 4
The digits of 6130 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 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6130 = 2 \times 5 \times 613 \]
6130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 11052 |
| Euler totient φ(n) | 2448 |
| Square | 37576900 |
| Cube | 230346397000 |
| Square root | 78.294317 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 155 |
| Scientific notation | 6.13 × |
6130 in other forms
| Form | Value |
|---|---|
| In words | six thousand one hundred and thirty |
| Binary (base 2) | 1011111110010 |
| Octal (base 8) | 13762 |
| Hexadecimal (base 16) | 17F2 |
| Base 3 | 22102001 |
| As time | 6130 seconds = 1 h 42 min 10 s |
Is 6130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6130 ÷ 2 = 3065) | 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 (6130 ÷ 5 = 1226) | 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 2) | 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 (6130 ÷ 10 = 613) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 6130 a prime number?
No. 6130 = 2 × 5 × 613, so it is divisible by 2.
What are the factors of 6130?
1, 2, 5, 10, 613, 1226, 3065, 6130.
What is 6130 in binary?
1011111110010 (hexadecimal 17F2, octal 13762).
What is the square root of 6130?
About 78.2943.
Is 6130 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 6130?
6130 is a Harshad number: divisible by its digit sum 10.