The number 50090
50090 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5009. Divisors (8): 1, 2, 5, 10, 5009, 10018, 25045, 50090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50090 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50090 is composite. Its prime factorisation is
- 3
The divisors add up to 90180; without 50090 itself that is 40090, so 50090 is deficient (40090 is less than 50090). Euler's totient φ(50090) = 20032 numbers up to 50090 share no factor with it.
- 4
The digits of 50090 add up to 14, 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
\[ 50090 = 2 \times 5 \times 5009 \]
50090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90180 |
| Euler totient φ(n) | 20032 |
| Square | 2509008100 |
| Cube | 125676215729000 |
| Square root | 223.807953 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.009 × |
50090 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and ninety |
| Binary (base 2) | 1100001110101010 |
| Octal (base 8) | 141652 |
| Hexadecimal (base 16) | C3AA |
| Base 3 | 2112201012 |
| As time | 50090 seconds = 13 h 54 min 50 s |
Is 50090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50090 ÷ 2 = 25045) | 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 (50090 ÷ 5 = 10018) | 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 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 2) | 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 | Yes (50090 ÷ 10 = 5009) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 50090 a prime number?
No. 50090 = 2 × 5 × 5009, so it is divisible by 2.
What are the factors of 50090?
1, 2, 5, 10, 5009, 10018, 25045, 50090.
What is 50090 in binary?
1100001110101010 (hexadecimal C3AA, octal 141652).
What is the square root of 50090?
About 223.8080.
Is 50090 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50090?
It is a composite number with 8 divisors.