The number 5751
5751 is a composite number with 10 divisors. Its prime factorisation is × 71. Divisors (10): 1, 3, 9, 27, 71, 81, 213, 639, 1917, 5751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5751: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5751 is composite. Its prime factorisation is
- 3
The divisors add up to 8712; without 5751 itself that is 2961, so 5751 is deficient (2961 is less than 5751). Euler's totient φ(5751) = 3780 numbers up to 5751 share no factor with it.
- 4
The digits of 5751 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5751 = 3^{4} \times 71 \]5751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 8712 |
| Euler totient φ(n) | 3780 |
| Square | 33074001 |
| Cube | 190208579751 |
| Square root | 75.835348 (= 9√71) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.751 × |
5751 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and fifty-one |
| Binary (base 2) | 1011001110111 |
| Octal (base 8) | 13167 |
| Hexadecimal (base 16) | 1677 |
| Base 3 | 21220000 |
| As time | 5751 seconds = 1 h 35 min 51 s |
Is 5751 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 (5751 ÷ 3 = 1917) | 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 4) | 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 (5751 ÷ 9 = 639) | 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 9) | 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 5751 a prime number?
No. 5751 = × 71, so it is divisible by 3.
What are the factors of 5751?
1, 3, 9, 27, 71, 81, 213, 639, 1917, 5751.
What is 5751 in binary?
1011001110111 (hexadecimal 1677, octal 13167).
What is the square root of 5751?
About 75.8353, exactly 9√71.
Is 5751 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5751?
5751 is a happy number: repeatedly adding the squares of its digits reaches 1.