The number 50807
50807 is a composite number with 6 divisors. Its prime factorisation is 23 Ć . Divisors (6): 1, 23, 47, 1081, 2209, 50807.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50807 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50807 is composite. Its prime factorisation is
- 3
The divisors add up to 54168; without 50807 itself that is 3361, so 50807 is deficient (3361 is less than 50807). Euler's totient Ļ(50807) = 47564 numbers up to 50807 share no factor with it.
- 4
The digits of 50807 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50807 = 23 \times 47^{2} \]50807 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 54168 |
| Euler totient Ļ(n) | 47564 |
| Square | 2581351249 |
| Cube | 131150712907943 |
| Square root | 225.404082 (= 47ā23) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.0807 Ć |
50807 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and seven |
| Binary (base 2) | 1100011001110111 |
| Octal (base 8) | 143167 |
| Hexadecimal (base 16) | C677 |
| Base 3 | 2120200202 |
| As time | 50807 seconds = 14 h 6 min 47 s |
Is 50807 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | 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 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50807 a prime number?
No. 50807 = 23 Ć , so it is divisible by 23.
What are the factors of 50807?
1, 23, 47, 1081, 2209, 50807.
What is 50807 in binary?
1100011001110111 (hexadecimal C677, octal 143167).
What is the square root of 50807?
About 225.4041, exactly 47ā23.
Is 50807 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50807?
It is a composite number with 6 divisors.