The number 50277
50277 is a composite number with 4 divisors. Its prime factorisation is 3 × 16759. Divisors (4): 1, 3, 16759, 50277.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50277: a semiprime: 3 × 16759, the product of two primes.
- 2
50277 is composite. Its prime factorisation is
- 3
The divisors add up to 67040; without 50277 itself that is 16763, so 50277 is deficient (16763 is less than 50277). Euler's totient φ(50277) = 33516 numbers up to 50277 share no factor with it.
- 4
The digits of 50277 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50277 = 3 \times 16759 \]
50277 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67040 |
| Euler totient φ(n) | 33516 |
| Square | 2527776729 |
| Cube | 127089030603933 |
| Square root | 224.225333 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0277 × |
50277 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and seventy-seven |
| Binary (base 2) | 1100010001100101 |
| Octal (base 8) | 142145 |
| Hexadecimal (base 16) | C465 |
| Base 3 | 2112222010 |
| As time | 50277 seconds = 13 h 57 min 57 s |
Is 50277 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 | Yes (50277 ÷ 3 = 16759) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50277 a prime number?
No. 50277 = 3 × 16759, so it is divisible by 3.
What are the factors of 50277?
1, 3, 16759, 50277.
What is 50277 in binary?
1100010001100101 (hexadecimal C465, octal 142145).
What is the square root of 50277?
About 224.2253.
Is 50277 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50277?
50277 is a semiprime: 3 × 16759, the product of two primes.