The number 51170
51170 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 17 × 43. Divisors (32): 1, 2, 5, 7, 10, 14, 17, 34, 35, 43, 70, 85, 86, 119, 170, 215 … 51170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51170: a Harshad number: divisible by its digit sum 14.
- 2
51170 is composite. Its prime factorisation is
- 3
The divisors add up to 114048; without 51170 itself that is 62878, so 51170 is abundant (62878 is more than 51170). Euler's totient φ(51170) = 16128 numbers up to 51170 share no factor with it.
- 4
The digits of 51170 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51170 = 2 \times 5 \times 7 \times 17 \times 43 \]
51170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 114048 |
| Euler totient φ(n) | 16128 |
| Square | 2618368900 |
| Cube | 133981936613000 |
| Square root | 226.207869 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.117 × |
51170 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and seventy |
| Binary (base 2) | 1100011111100010 |
| Octal (base 8) | 143742 |
| Hexadecimal (base 16) | C7E2 |
| Base 3 | 2121012012 |
| As time | 51170 seconds = 14 h 12 min 50 s |
Is 51170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51170 ÷ 2 = 25585) | 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 (51170 ÷ 5 = 10234) | 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 | Yes (51170 ÷ 7 = 7310) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51170 ÷ 10 = 5117) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 51170 a prime number?
No. 51170 = 2 × 5 × 7 × 17 × 43, so it is divisible by 2.
What are the factors of 51170?
1, 2, 5, 7, 10, 14, 17, 34, 35, 43, 70, 85, 86, 119, 170, 215, 238, 301, 430, 595, 602, 731, 1190, 1462, 1505, 3010, 3655, 5117, 7310, 10234, 25585, 51170.
What is 51170 in binary?
1100011111100010 (hexadecimal C7E2, octal 143742).
What is the square root of 51170?
About 226.2079.
Is 51170 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51170?
51170 is a Harshad number: divisible by its digit sum 14.