The number 50390
50390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5039. Divisors (8): 1, 2, 5, 10, 5039, 10078, 25195, 50390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50390 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 50390 itself that is 40330, so 50390 is deficient (40330 is less than 50390). Euler's totient φ(50390) = 20152 numbers up to 50390 share no factor with it.
- 4
The digits of 50390 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50390 = 2 \times 5 \times 5039 \]
50390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 20152 |
| Square | 2539152100 |
| Cube | 127947874319000 |
| Square root | 224.477170 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.039 × |
50390 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and ninety |
| Binary (base 2) | 1100010011010110 |
| Octal (base 8) | 142326 |
| Hexadecimal (base 16) | C4D6 |
| Base 3 | 2120010022 |
| As time | 50390 seconds = 13 h 59 min 50 s |
Is 50390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50390 ÷ 2 = 25195) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50390 ÷ 5 = 10078) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | 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 | Yes (50390 ÷ 10 = 5039) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50390 a prime number?
No. 50390 = 2 × 5 × 5039, so it is divisible by 2.
What are the factors of 50390?
1, 2, 5, 10, 5039, 10078, 25195, 50390.
What is 50390 in binary?
1100010011010110 (hexadecimal C4D6, octal 142326).
What is the square root of 50390?
About 224.4772.
Is 50390 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50390?
It is a composite number with 8 divisors.