The number 50705
50705 is a palindrome: it reads 50705 backwards too. Its prime factorisation is 5 × 10141. Divisors (4): 1, 5, 10141, 50705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50705: a palindrome: it reads 50705 backwards too; a semiprime: 5 × 10141, the product of two primes.
- 2
50705 is composite. Its prime factorisation is
- 3
The divisors add up to 60852; without 50705 itself that is 10147, so 50705 is deficient (10147 is less than 50705). Euler's totient φ(50705) = 40560 numbers up to 50705 share no factor with it.
- 4
The digits of 50705 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50705 = 5 \times 10141 \]
50705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60852 |
| Euler totient φ(n) | 40560 |
| Square | 2570997025 |
| Cube | 130362404152625 |
| Square root | 225.177708 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0705 × |
50705 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and five |
| Binary (base 2) | 1100011000010001 |
| Octal (base 8) | 143021 |
| Hexadecimal (base 16) | C611 |
| Base 3 | 2120112222 |
| As time | 50705 seconds = 14 h 5 min 5 s |
Is 50705 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 (50705 ÷ 5 = 10141) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | 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 50705 a prime number?
No. 50705 = 5 × 10141, so it is divisible by 5.
What are the factors of 50705?
1, 5, 10141, 50705.
What is 50705 in binary?
1100011000010001 (hexadecimal C611, octal 143021).
What is the square root of 50705?
About 225.1777.
Is 50705 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50705?
50705 is a palindrome: it reads 50705 backwards too; a semiprime: 5 × 10141, the product of two primes.