The number 50290
50290 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 47 × 107. Divisors (16): 1, 2, 5, 10, 47, 94, 107, 214, 235, 470, 535, 1070, 5029, 10058, 25145, 50290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50290 is composite. Its prime factorisation is
- 3
The divisors add up to 93312; without 50290 itself that is 43022, so 50290 is deficient (43022 is less than 50290). Euler's totient φ(50290) = 19504 numbers up to 50290 share no factor with it.
- 4
The digits of 50290 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50290 = 2 \times 5 \times 47 \times 107 \]
50290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93312 |
| Euler totient φ(n) | 19504 |
| Square | 2529084100 |
| Cube | 127187639389000 |
| Square root | 224.254320 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.029 × |
50290 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and ninety |
| Binary (base 2) | 1100010001110010 |
| Octal (base 8) | 142162 |
| Hexadecimal (base 16) | C472 |
| Base 3 | 2112222121 |
| As time | 50290 seconds = 13 h 58 min 10 s |
Is 50290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50290 ÷ 2 = 25145) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50290 ÷ 5 = 10058) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50290 ÷ 10 = 5029) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50290 a prime number?
No. 50290 = 2 × 5 × 47 × 107, so it is divisible by 2.
What are the factors of 50290?
1, 2, 5, 10, 47, 94, 107, 214, 235, 470, 535, 1070, 5029, 10058, 25145, 50290.
What is 50290 in binary?
1100010001110010 (hexadecimal C472, octal 142162).
What is the square root of 50290?
About 224.2543.
Is 50290 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50290?
It is a composite number with 16 divisors.