The number 60130
60130 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 859. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 859, 1718, 4295, 6013, 8590, 12026, 30065, 60130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60130: a Harshad number: divisible by its digit sum 10.
- 2
60130 is composite. Its prime factorisation is
- 3
The divisors add up to 123840; without 60130 itself that is 63710, so 60130 is abundant (63710 is more than 60130). Euler's totient φ(60130) = 20592 numbers up to 60130 share no factor with it.
- 4
The digits of 60130 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60130 = 2 \times 5 \times 7 \times 859 \]
60130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123840 |
| Euler totient φ(n) | 20592 |
| Square | 3615616900 |
| Cube | 217407044197000 |
| Square root | 245.214192 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.013 × |
60130 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and thirty |
| Binary (base 2) | 1110101011100010 |
| Octal (base 8) | 165342 |
| Hexadecimal (base 16) | EAE2 |
| Base 3 | 10001111001 |
| As time | 60130 seconds = 16 h 42 min 10 s |
Is 60130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60130 ÷ 2 = 30065) | 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 (60130 ÷ 5 = 12026) | 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 (60130 ÷ 7 = 8590) | 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 (60130 ÷ 10 = 6013) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60130 a prime number?
No. 60130 = 2 × 5 × 7 × 859, so it is divisible by 2.
What are the factors of 60130?
1, 2, 5, 7, 10, 14, 35, 70, 859, 1718, 4295, 6013, 8590, 12026, 30065, 60130.
What is 60130 in binary?
1110101011100010 (hexadecimal EAE2, octal 165342).
What is the square root of 60130?
About 245.2142.
Is 60130 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 60130?
60130 is a Harshad number: divisible by its digit sum 10.