The number 51
51 is a binary palindrome (110011). Its prime factorisation is 3 × 17. Divisors (4): 1, 3, 17, 51.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51: a binary palindrome (110011); a semiprime: 3 × 17, the product of two primes.
- 2
51 is composite. Its prime factorisation is
- 3
The divisors add up to 72; without 51 itself that is 21, so 51 is deficient (21 is less than 51). Euler's totient φ(51) = 32 numbers up to 51 share no factor with it.
- 4
The digits of 51 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51 = 3 \times 17 \]
51 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72 |
| Euler totient φ(n) | 32 |
| Square | 2601 |
| Cube | 132651 |
| Square root | 7.141428 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 24 |
| Scientific notation | 5.1 × |
51 in other forms
| Form | Value |
|---|---|
| In words | fifty-one |
| Roman numerals | LI |
| Binary (base 2) | 110011 |
| Octal (base 8) | 63 |
| Hexadecimal (base 16) | 33 |
| Base 3 | 1220 |
| As time | 51 seconds |
Is 51 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 (51 ÷ 3 = 17) | 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 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 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 7) | 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 51 a prime number?
No. 51 = 3 × 17, so it is divisible by 3.
What are the factors of 51?
1, 3, 17, 51.
What is 51 in binary?
110011 (hexadecimal 33, octal 63).
What is the square root of 51?
About 7.1414.
What is 51 in Roman numerals?
LI.
Is 51 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 51?
51 is a binary palindrome (110011); a semiprime: 3 × 17, the product of two primes.