The number 61130
61130 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 6113. Divisors (8): 1, 2, 5, 10, 6113, 12226, 30565, 61130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61130 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61130 is composite. Its prime factorisation is
- 3
The divisors add up to 110052; without 61130 itself that is 48922, so 61130 is deficient (48922 is less than 61130). Euler's totient φ(61130) = 24448 numbers up to 61130 share no factor with it.
- 4
The digits of 61130 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61130 = 2 \times 5 \times 6113 \]
61130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 110052 |
| Euler totient φ(n) | 24448 |
| Square | 3736876900 |
| Cube | 228435284897000 |
| Square root | 247.244818 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 34 |
| Scientific notation | 6.113 × |
61130 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and thirty |
| Binary (base 2) | 1110111011001010 |
| Octal (base 8) | 167312 |
| Hexadecimal (base 16) | EECA |
| Base 3 | 10002212002 |
| As time | 61130 seconds = 16 h 58 min 50 s |
Is 61130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61130 ÷ 2 = 30565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (61130 ÷ 5 = 12226) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61130 ÷ 10 = 6113) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61130 a prime number?
No. 61130 = 2 × 5 × 6113, so it is divisible by 2.
What are the factors of 61130?
1, 2, 5, 10, 6113, 12226, 30565, 61130.
What is 61130 in binary?
1110111011001010 (hexadecimal EECA, octal 167312).
What is the square root of 61130?
About 247.2448.
Is 61130 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 61130?
It is a composite number with 8 divisors.