The number 50770
50770 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5077. Divisors (8): 1, 2, 5, 10, 5077, 10154, 25385, 50770.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50770 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50770 is composite. Its prime factorisation is
- 3
The divisors add up to 91404; without 50770 itself that is 40634, so 50770 is deficient (40634 is less than 50770). Euler's totient φ(50770) = 20304 numbers up to 50770 share no factor with it.
- 4
The digits of 50770 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50770 = 2 \times 5 \times 5077 \]
50770 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91404 |
| Euler totient φ(n) | 20304 |
| Square | 2577592900 |
| Cube | 130864391533000 |
| Square root | 225.321992 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.077 × |
50770 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and seventy |
| Binary (base 2) | 1100011001010010 |
| Octal (base 8) | 143122 |
| Hexadecimal (base 16) | C652 |
| Base 3 | 2120122101 |
| As time | 50770 seconds = 14 h 6 min 10 s |
Is 50770 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50770 ÷ 2 = 25385) | 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 (50770 ÷ 5 = 10154) | 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 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50770 ÷ 10 = 5077) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 50770 a prime number?
No. 50770 = 2 × 5 × 5077, so it is divisible by 2.
What are the factors of 50770?
1, 2, 5, 10, 5077, 10154, 25385, 50770.
What is 50770 in binary?
1100011001010010 (hexadecimal C652, octal 143122).
What is the square root of 50770?
About 225.3220.
Is 50770 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50770?
It is a composite number with 8 divisors.