The number 51370
51370 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 467. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 467, 934, 2335, 4670, 5137, 10274, 25685, 51370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51370 is composite. Its prime factorisation is
- 3
The divisors add up to 101088; without 51370 itself that is 49718, so 51370 is deficient (49718 is less than 51370). Euler's totient φ(51370) = 18640 numbers up to 51370 share no factor with it.
- 4
The digits of 51370 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51370 = 2 \times 5 \times 11 \times 467 \]
51370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 101088 |
| Euler totient φ(n) | 18640 |
| Square | 2638876900 |
| Cube | 135559106353000 |
| Square root | 226.649509 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 26 |
| Scientific notation | 5.137 × |
51370 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and seventy |
| Binary (base 2) | 1100100010101010 |
| Octal (base 8) | 144252 |
| Hexadecimal (base 16) | C8AA |
| Base 3 | 2121110121 |
| As time | 51370 seconds = 14 h 16 min 10 s |
Is 51370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51370 ÷ 2 = 25685) | 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 (51370 ÷ 5 = 10274) | 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 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51370 ÷ 10 = 5137) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51370 ÷ 11 = 4670) | 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 51370 a prime number?
No. 51370 = 2 × 5 × 11 × 467, so it is divisible by 2.
What are the factors of 51370?
1, 2, 5, 10, 11, 22, 55, 110, 467, 934, 2335, 4670, 5137, 10274, 25685, 51370.
What is 51370 in binary?
1100100010101010 (hexadecimal C8AA, octal 144252).
What is the square root of 51370?
About 226.6495.
Is 51370 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51370?
It is a composite number with 16 divisors.