The number 5709
5709 is a binary palindrome (1011001001101). Its prime factorisation is 3 × 11 × 173. Divisors (8): 1, 3, 11, 33, 173, 519, 1903, 5709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5709: a binary palindrome (1011001001101).
- 2
5709 is composite. Its prime factorisation is
- 3
The divisors add up to 8352; without 5709 itself that is 2643, so 5709 is deficient (2643 is less than 5709). Euler's totient φ(5709) = 3440 numbers up to 5709 share no factor with it.
- 4
The digits of 5709 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5709 = 3 \times 11 \times 173 \]
5709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8352 |
| Euler totient φ(n) | 3440 |
| Square | 32592681 |
| Cube | 186071615829 |
| Square root | 75.557925 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.709 × |
5709 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and nine |
| Binary (base 2) | 1011001001101 |
| Octal (base 8) | 13115 |
| Hexadecimal (base 16) | 164D |
| Base 3 | 21211110 |
| As time | 5709 seconds = 1 h 35 min 9 s |
Is 5709 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 (5709 ÷ 3 = 1903) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (5709 ÷ 11 = 519) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5709 a prime number?
No. 5709 = 3 × 11 × 173, so it is divisible by 3.
What are the factors of 5709?
1, 3, 11, 33, 173, 519, 1903, 5709.
What is 5709 in binary?
1011001001101 (hexadecimal 164D, octal 13115).
What is the square root of 5709?
About 75.5579.
Is 5709 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5709?
5709 is a binary palindrome (1011001001101).