The number 51751
51751 is a composite number with 4 divisors. Its prime factorisation is 7 × 7393. Divisors (4): 1, 7, 7393, 51751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51751: a semiprime: 7 × 7393, the product of two primes.
- 2
51751 is composite. Its prime factorisation is
- 3
The divisors add up to 59152; without 51751 itself that is 7401, so 51751 is deficient (7401 is less than 51751). Euler's totient φ(51751) = 44352 numbers up to 51751 share no factor with it.
- 4
The digits of 51751 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51751 = 7 \times 7393 \]
51751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59152 |
| Euler totient φ(n) | 44352 |
| Square | 2678166001 |
| Cube | 138597768717751 |
| Square root | 227.488461 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.1751 × |
51751 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand seven hundred and fifty-one |
| Binary (base 2) | 1100101000100111 |
| Octal (base 8) | 145047 |
| Hexadecimal (base 16) | CA27 |
| Base 3 | 2121222201 |
| As time | 51751 seconds = 14 h 22 min 31 s |
Is 51751 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51751 ÷ 7 = 7393) | 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 7) | 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 | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51751 a prime number?
No. 51751 = 7 × 7393, so it is divisible by 7.
What are the factors of 51751?
1, 7, 7393, 51751.
What is 51751 in binary?
1100101000100111 (hexadecimal CA27, octal 145047).
What is the square root of 51751?
About 227.4885.
Is 51751 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51751?
51751 is a semiprime: 7 × 7393, the product of two primes.