The number 5753
5753 is a composite number with 4 divisors. Its prime factorisation is 11 × 523. Divisors (4): 1, 11, 523, 5753.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5753: a semiprime: 11 × 523, the product of two primes.
- 2
5753 is composite. Its prime factorisation is
- 3
The divisors add up to 6288; without 5753 itself that is 535, so 5753 is deficient (535 is less than 5753). Euler's totient φ(5753) = 5220 numbers up to 5753 share no factor with it.
- 4
The digits of 5753 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5753 = 11 \times 523 \]
5753 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6288 |
| Euler totient φ(n) | 5220 |
| Square | 33097009 |
| Cube | 190407092777 |
| Square root | 75.848533 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 129 |
| Scientific notation | 5.753 × |
5753 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and fifty-three |
| Binary (base 2) | 1011001111001 |
| Octal (base 8) | 13171 |
| Hexadecimal (base 16) | 1679 |
| Base 3 | 21220002 |
| As time | 5753 seconds = 1 h 35 min 53 s |
Is 5753 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (5753 ÷ 11 = 523) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5753 a prime number?
No. 5753 = 11 × 523, so it is divisible by 11.
What are the factors of 5753?
1, 11, 523, 5753.
What is 5753 in binary?
1011001111001 (hexadecimal 1679, octal 13171).
What is the square root of 5753?
About 75.8485.
Is 5753 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5753?
5753 is a semiprime: 11 × 523, the product of two primes.