The number 50493
50493 is a composite number with 4 divisors. Its prime factorisation is 3 × 16831. Divisors (4): 1, 3, 16831, 50493.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50493: a semiprime: 3 × 16831, the product of two primes.
- 2
50493 is composite. Its prime factorisation is
- 3
The divisors add up to 67328; without 50493 itself that is 16835, so 50493 is deficient (16835 is less than 50493). Euler's totient φ(50493) = 33660 numbers up to 50493 share no factor with it.
- 4
The digits of 50493 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50493 = 3 \times 16831 \]
50493 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67328 |
| Euler totient φ(n) | 33660 |
| Square | 2549543049 |
| Cube | 128734077173157 |
| Square root | 224.706475 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0493 × |
50493 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and ninety-three |
| Binary (base 2) | 1100010100111101 |
| Octal (base 8) | 142475 |
| Hexadecimal (base 16) | C53D |
| Base 3 | 2120021010 |
| As time | 50493 seconds = 14 h 1 min 33 s |
Is 50493 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 | Yes (50493 ÷ 3 = 16831) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50493 a prime number?
No. 50493 = 3 × 16831, so it is divisible by 3.
What are the factors of 50493?
1, 3, 16831, 50493.
What is 50493 in binary?
1100010100111101 (hexadecimal C53D, octal 142475).
What is the square root of 50493?
About 224.7065.
Is 50493 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50493?
50493 is a semiprime: 3 × 16831, the product of two primes.