The number 50843
50843 is a composite number with 4 divisors. Its prime factorisation is 13 × 3911. Divisors (4): 1, 13, 3911, 50843.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50843: a semiprime: 13 × 3911, the product of two primes.
- 2
50843 is composite. Its prime factorisation is
- 3
The divisors add up to 54768; without 50843 itself that is 3925, so 50843 is deficient (3925 is less than 50843). Euler's totient φ(50843) = 46920 numbers up to 50843 share no factor with it.
- 4
The digits of 50843 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50843 = 13 \times 3911 \]
50843 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54768 |
| Euler totient φ(n) | 46920 |
| Square | 2585010649 |
| Cube | 131429696427107 |
| Square root | 225.483924 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0843 × |
50843 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and forty-three |
| Binary (base 2) | 1100011010011011 |
| Octal (base 8) | 143233 |
| Hexadecimal (base 16) | C69B |
| Base 3 | 2120202002 |
| As time | 50843 seconds = 14 h 7 min 23 s |
Is 50843 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 3) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 50843 a prime number?
No. 50843 = 13 × 3911, so it is divisible by 13.
What are the factors of 50843?
1, 13, 3911, 50843.
What is 50843 in binary?
1100011010011011 (hexadecimal C69B, octal 143233).
What is the square root of 50843?
About 225.4839.
Is 50843 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50843?
50843 is a semiprime: 13 × 3911, the product of two primes.