The number 50590
50590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5059. Divisors (8): 1, 2, 5, 10, 5059, 10118, 25295, 50590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50590 is composite. Its prime factorisation is
- 3
The divisors add up to 91080; without 50590 itself that is 40490, so 50590 is deficient (40490 is less than 50590). Euler's totient φ(50590) = 20232 numbers up to 50590 share no factor with it.
- 4
The digits of 50590 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50590 = 2 \times 5 \times 5059 \]
50590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91080 |
| Euler totient φ(n) | 20232 |
| Square | 2559348100 |
| Cube | 129477420379000 |
| Square root | 224.922209 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.059 × |
50590 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and ninety |
| Binary (base 2) | 1100010110011110 |
| Octal (base 8) | 142636 |
| Hexadecimal (base 16) | C59E |
| Base 3 | 2120101201 |
| As time | 50590 seconds = 14 h 3 min 10 s |
Is 50590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50590 ÷ 2 = 25295) | 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 (50590 ÷ 5 = 10118) | 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 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50590 ÷ 10 = 5059) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50590 a prime number?
No. 50590 = 2 × 5 × 5059, so it is divisible by 2.
What are the factors of 50590?
1, 2, 5, 10, 5059, 10118, 25295, 50590.
What is 50590 in binary?
1100010110011110 (hexadecimal C59E, octal 142636).
What is the square root of 50590?
About 224.9222.
Is 50590 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50590?
It is a composite number with 8 divisors.