The number 50927
50927 is a composite number with 4 divisors. Its prime factorisation is 127 × 401. Divisors (4): 1, 127, 401, 50927.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50927: a semiprime: 127 × 401, the product of two primes.
- 2
50927 is composite. Its prime factorisation is
- 3
The divisors add up to 51456; without 50927 itself that is 529, so 50927 is deficient (529 is less than 50927). Euler's totient φ(50927) = 50400 numbers up to 50927 share no factor with it.
- 4
The digits of 50927 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50927 = 127 \times 401 \]
50927 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51456 |
| Euler totient φ(n) | 50400 |
| Square | 2593559329 |
| Cube | 132082195947983 |
| Square root | 225.670113 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.0927 × |
50927 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and twenty-seven |
| Binary (base 2) | 1100011011101111 |
| Octal (base 8) | 143357 |
| Hexadecimal (base 16) | C6EF |
| Base 3 | 2120212012 |
| As time | 50927 seconds = 14 h 8 min 47 s |
Is 50927 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 2) | 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 5) | 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 8) | 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 50927 a prime number?
No. 50927 = 127 × 401, so it is divisible by 127.
What are the factors of 50927?
1, 127, 401, 50927.
What is 50927 in binary?
1100011011101111 (hexadecimal C6EF, octal 143357).
What is the square root of 50927?
About 225.6701.
Is 50927 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50927?
50927 is a semiprime: 127 × 401, the product of two primes.