The number 50690
50690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 37 × 137. Divisors (16): 1, 2, 5, 10, 37, 74, 137, 185, 274, 370, 685, 1370, 5069, 10138, 25345, 50690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50690 is composite. Its prime factorisation is
- 3
The divisors add up to 94392; without 50690 itself that is 43702, so 50690 is deficient (43702 is less than 50690). Euler's totient φ(50690) = 19584 numbers up to 50690 share no factor with it.
- 4
The digits of 50690 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50690 = 2 \times 5 \times 37 \times 137 \]
50690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 94392 |
| Euler totient φ(n) | 19584 |
| Square | 2569476100 |
| Cube | 130246743509000 |
| Square root | 225.144398 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.069 × |
50690 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and ninety |
| Binary (base 2) | 1100011000000010 |
| Octal (base 8) | 143002 |
| Hexadecimal (base 16) | C602 |
| Base 3 | 2120112102 |
| As time | 50690 seconds = 14 h 4 min 50 s |
Is 50690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50690 ÷ 2 = 25345) | 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 (50690 ÷ 5 = 10138) | 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 3) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50690 ÷ 10 = 5069) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 50690 a prime number?
No. 50690 = 2 × 5 × 37 × 137, so it is divisible by 2.
What are the factors of 50690?
1, 2, 5, 10, 37, 74, 137, 185, 274, 370, 685, 1370, 5069, 10138, 25345, 50690.
What is 50690 in binary?
1100011000000010 (hexadecimal C602, octal 143002).
What is the square root of 50690?
About 225.1444.
Is 50690 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50690?
It is a composite number with 16 divisors.