The number 51310
51310 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 733. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 733, 1466, 3665, 5131, 7330, 10262, 25655, 51310.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51310: a Harshad number: divisible by its digit sum 10.
- 2
51310 is composite. Its prime factorisation is
- 3
The divisors add up to 105696; without 51310 itself that is 54386, so 51310 is abundant (54386 is more than 51310). Euler's totient φ(51310) = 17568 numbers up to 51310 share no factor with it.
- 4
The digits of 51310 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
\[ 51310 = 2 \times 5 \times 7 \times 733 \]
51310 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 105696 |
| Euler totient φ(n) | 17568 |
| Square | 2632716100 |
| Cube | 135084663091000 |
| Square root | 226.517108 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.131 × |
51310 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ten |
| Binary (base 2) | 1100100001101110 |
| Octal (base 8) | 144156 |
| Hexadecimal (base 16) | C86E |
| Base 3 | 2121101101 |
| As time | 51310 seconds = 14 h 15 min 10 s |
Is 51310 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51310 ÷ 2 = 25655) | 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 (51310 ÷ 5 = 10262) | 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 (51310 ÷ 7 = 7330) | 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 6) | 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 (51310 ÷ 10 = 5131) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 51310 a prime number?
No. 51310 = 2 × 5 × 7 × 733, so it is divisible by 2.
What are the factors of 51310?
1, 2, 5, 7, 10, 14, 35, 70, 733, 1466, 3665, 5131, 7330, 10262, 25655, 51310.
What is 51310 in binary?
1100100001101110 (hexadecimal C86E, octal 144156).
What is the square root of 51310?
About 226.5171.
Is 51310 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51310?
51310 is a Harshad number: divisible by its digit sum 10.