The number 50921
50921 is a composite number with 4 divisors. Its prime factorisation is 13 × 3917. Divisors (4): 1, 13, 3917, 50921.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50921: a semiprime: 13 × 3917, the product of two primes.
- 2
50921 is composite. Its prime factorisation is
- 3
The divisors add up to 54852; without 50921 itself that is 3931, so 50921 is deficient (3931 is less than 50921). Euler's totient φ(50921) = 46992 numbers up to 50921 share no factor with it.
- 4
The digits of 50921 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50921 = 13 \times 3917 \]
50921 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54852 |
| Euler totient φ(n) | 46992 |
| Square | 2592948241 |
| Cube | 132035517379961 |
| Square root | 225.656819 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0921 × |
50921 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and twenty-one |
| Binary (base 2) | 1100011011101001 |
| Octal (base 8) | 143351 |
| Hexadecimal (base 16) | C6E9 |
| Base 3 | 2120211222 |
| As time | 50921 seconds = 14 h 8 min 41 s |
Is 50921 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50921 a prime number?
No. 50921 = 13 × 3917, so it is divisible by 13.
What are the factors of 50921?
1, 13, 3917, 50921.
What is 50921 in binary?
1100011011101001 (hexadecimal C6E9, octal 143351).
What is the square root of 50921?
About 225.6568.
Is 50921 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50921?
50921 is a semiprime: 13 × 3917, the product of two primes.