The number 50693
50693 is a composite number with 4 divisors. Its prime factorisation is 163 × 311. Divisors (4): 1, 163, 311, 50693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50693: a semiprime: 163 × 311, the product of two primes.
- 2
50693 is composite. Its prime factorisation is
- 3
The divisors add up to 51168; without 50693 itself that is 475, so 50693 is deficient (475 is less than 50693). Euler's totient φ(50693) = 50220 numbers up to 50693 share no factor with it.
- 4
The digits of 50693 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50693 = 163 \times 311 \]
50693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51168 |
| Euler totient φ(n) | 50220 |
| Square | 2569780249 |
| Cube | 130269870162557 |
| Square root | 225.151060 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0693 × |
50693 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and ninety-three |
| Binary (base 2) | 1100011000000101 |
| Octal (base 8) | 143005 |
| Hexadecimal (base 16) | C605 |
| Base 3 | 2120112112 |
| As time | 50693 seconds = 14 h 4 min 53 s |
Is 50693 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 5) | 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 50693 a prime number?
No. 50693 = 163 × 311, so it is divisible by 163.
What are the factors of 50693?
1, 163, 311, 50693.
What is 50693 in binary?
1100011000000101 (hexadecimal C605, octal 143005).
What is the square root of 50693?
About 225.1511.
Is 50693 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50693?
50693 is a semiprime: 163 × 311, the product of two primes.