The number 51171
51171 is a binary palindrome (1100011111100011). Its prime factorisation is 3 × 37 × 461. Divisors (8): 1, 3, 37, 111, 461, 1383, 17057, 51171.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51171: a binary palindrome (1100011111100011).
- 2
51171 is composite. Its prime factorisation is
- 3
The divisors add up to 70224; without 51171 itself that is 19053, so 51171 is deficient (19053 is less than 51171). Euler's totient φ(51171) = 33120 numbers up to 51171 share no factor with it.
- 4
The digits of 51171 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51171 = 3 \times 37 \times 461 \]
51171 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70224 |
| Euler totient φ(n) | 33120 |
| Square | 2618471241 |
| Cube | 133989791873211 |
| Square root | 226.210079 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1171 × |
51171 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and seventy-one |
| Binary (base 2) | 1100011111100011 |
| Octal (base 8) | 143743 |
| Hexadecimal (base 16) | C7E3 |
| Base 3 | 2121012020 |
| As time | 51171 seconds = 14 h 12 min 51 s |
Is 51171 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51171 ÷ 3 = 17057) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51171 a prime number?
No. 51171 = 3 × 37 × 461, so it is divisible by 3.
What are the factors of 51171?
1, 3, 37, 111, 461, 1383, 17057, 51171.
What is 51171 in binary?
1100011111100011 (hexadecimal C7E3, octal 143743).
What is the square root of 51171?
About 226.2101.
Is 51171 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51171?
51171 is a binary palindrome (1100011111100011).