The number 51130
51130 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5113. Divisors (8): 1, 2, 5, 10, 5113, 10226, 25565, 51130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51130: a Harshad number: divisible by its digit sum 10.
- 2
51130 is composite. Its prime factorisation is
- 3
The divisors add up to 92052; without 51130 itself that is 40922, so 51130 is deficient (40922 is less than 51130). Euler's totient φ(51130) = 20448 numbers up to 51130 share no factor with it.
- 4
The digits of 51130 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51130 = 2 \times 5 \times 5113 \]
51130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 92052 |
| Euler totient φ(n) | 20448 |
| Square | 2614276900 |
| Cube | 133667977897000 |
| Square root | 226.119437 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.113 × |
51130 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and thirty |
| Binary (base 2) | 1100011110111010 |
| Octal (base 8) | 143672 |
| Hexadecimal (base 16) | C7BA |
| Base 3 | 2121010201 |
| As time | 51130 seconds = 14 h 12 min 10 s |
Is 51130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51130 ÷ 2 = 25565) | 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 (51130 ÷ 5 = 10226) | 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 2) | 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 (51130 ÷ 10 = 5113) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 51130 a prime number?
No. 51130 = 2 × 5 × 5113, so it is divisible by 2.
What are the factors of 51130?
1, 2, 5, 10, 5113, 10226, 25565, 51130.
What is 51130 in binary?
1100011110111010 (hexadecimal C7BA, octal 143672).
What is the square root of 51130?
About 226.1194.
Is 51130 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51130?
51130 is a Harshad number: divisible by its digit sum 10.