The number 50293
50293 is a composite number with 4 divisors. Its prime factorisation is 19 × 2647. Divisors (4): 1, 19, 2647, 50293.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50293: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2647, the product of two primes.
- 2
50293 is composite. Its prime factorisation is
- 3
The divisors add up to 52960; without 50293 itself that is 2667, so 50293 is deficient (2667 is less than 50293). Euler's totient φ(50293) = 47628 numbers up to 50293 share no factor with it.
- 4
The digits of 50293 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50293 = 19 \times 2647 \]
50293 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52960 |
| Euler totient φ(n) | 47628 |
| Square | 2529385849 |
| Cube | 127210402503757 |
| Square root | 224.261009 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0293 × |
50293 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and ninety-three |
| Binary (base 2) | 1100010001110101 |
| Octal (base 8) | 142165 |
| Hexadecimal (base 16) | C475 |
| Base 3 | 2112222201 |
| As time | 50293 seconds = 13 h 58 min 13 s |
Is 50293 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50293 a prime number?
No. 50293 = 19 × 2647, so it is divisible by 19.
What are the factors of 50293?
1, 19, 2647, 50293.
What is 50293 in binary?
1100010001110101 (hexadecimal C475, octal 142165).
What is the square root of 50293?
About 224.2610.
Is 50293 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50293?
50293 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2647, the product of two primes.