The number 53705
53705 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 467. Divisors (8): 1, 5, 23, 115, 467, 2335, 10741, 53705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53705 is composite. Its prime factorisation is
- 3
The divisors add up to 67392; without 53705 itself that is 13687, so 53705 is deficient (13687 is less than 53705). Euler's totient φ(53705) = 41008 numbers up to 53705 share no factor with it.
- 4
The digits of 53705 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53705 = 5 \times 23 \times 467 \]
53705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67392 |
| Euler totient φ(n) | 41008 |
| Square | 2884227025 |
| Cube | 154897412377625 |
| Square root | 231.743393 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3705 × |
53705 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand seven hundred and five |
| Binary (base 2) | 1101000111001001 |
| Octal (base 8) | 150711 |
| Hexadecimal (base 16) | D1C9 |
| Base 3 | 2201200002 |
| As time | 53705 seconds = 14 h 55 min 5 s |
Is 53705 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 | Yes (53705 ÷ 5 = 10741) | 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 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 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 53705 a prime number?
No. 53705 = 5 × 23 × 467, so it is divisible by 5.
What are the factors of 53705?
1, 5, 23, 115, 467, 2335, 10741, 53705.
What is 53705 in binary?
1101000111001001 (hexadecimal D1C9, octal 150711).
What is the square root of 53705?
About 231.7434.
Is 53705 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53705?
It is a composite number with 8 divisors.