The number 50809
50809 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 149. Divisors (8): 1, 11, 31, 149, 341, 1639, 4619, 50809.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50809 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50809 is composite. Its prime factorisation is
- 3
The divisors add up to 57600; without 50809 itself that is 6791, so 50809 is deficient (6791 is less than 50809). Euler's totient φ(50809) = 44400 numbers up to 50809 share no factor with it.
- 4
The digits of 50809 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50809 = 11 \times 31 \times 149 \]
50809 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57600 |
| Euler totient φ(n) | 44400 |
| Square | 2581554481 |
| Cube | 131166201625129 |
| Square root | 225.408518 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0809 × |
50809 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and nine |
| Binary (base 2) | 1100011001111001 |
| Octal (base 8) | 143171 |
| Hexadecimal (base 16) | C679 |
| Base 3 | 2120200211 |
| As time | 50809 seconds = 14 h 6 min 49 s |
Is 50809 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50809 ÷ 11 = 4619) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50809 a prime number?
No. 50809 = 11 × 31 × 149, so it is divisible by 11.
What are the factors of 50809?
1, 11, 31, 149, 341, 1639, 4619, 50809.
What is 50809 in binary?
1100011001111001 (hexadecimal C679, octal 143171).
What is the square root of 50809?
About 225.4085.
Is 50809 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50809?
It is a composite number with 8 divisors.