The number 51759
51759 is a composite number with 14 divisors. Its prime factorisation is × 71. Divisors (14): 1, 3, 9, 27, 71, 81, 213, 243, 639, 729, 1917, 5751, 17253, 51759.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51759: a Harshad number: divisible by its digit sum 27.
- 2
51759 is composite. Its prime factorisation is
- 3
The divisors add up to 78696; without 51759 itself that is 26937, so 51759 is deficient (26937 is less than 51759). Euler's totient φ(51759) = 34020 numbers up to 51759 share no factor with it.
- 4
The digits of 51759 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51759 = 3^{6} \times 71 \]51759 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 78696 |
| Euler totient φ(n) | 34020 |
| Square | 2678994081 |
| Cube | 138662054638479 |
| Square root | 227.506044 (= 27√71) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1759 × |
51759 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand seven hundred and fifty-nine |
| Binary (base 2) | 1100101000101111 |
| Octal (base 8) | 145057 |
| Hexadecimal (base 16) | CA2F |
| Base 3 | 2122000000 |
| As time | 51759 seconds = 14 h 22 min 39 s |
Is 51759 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 (51759 ÷ 3 = 17253) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51759 ÷ 9 = 5751) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 51759 a prime number?
No. 51759 = × 71, so it is divisible by 3.
What are the factors of 51759?
1, 3, 9, 27, 71, 81, 213, 243, 639, 729, 1917, 5751, 17253, 51759.
What is 51759 in binary?
1100101000101111 (hexadecimal CA2F, octal 145057).
What is the square root of 51759?
About 227.5060, exactly 27√71.
Is 51759 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 51759?
51759 is a Harshad number: divisible by its digit sum 27.