The number 50943
50943 is a composite number with 4 divisors. Its prime factorisation is 3 × 16981. Divisors (4): 1, 3, 16981, 50943.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50943: a semiprime: 3 × 16981, the product of two primes.
- 2
50943 is composite. Its prime factorisation is
- 3
The divisors add up to 67928; without 50943 itself that is 16985, so 50943 is deficient (16985 is less than 50943). Euler's totient φ(50943) = 33960 numbers up to 50943 share no factor with it.
- 4
The digits of 50943 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50943 = 3 \times 16981 \]
50943 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67928 |
| Euler totient φ(n) | 33960 |
| Square | 2595189249 |
| Cube | 132206725911807 |
| Square root | 225.705560 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0943 × |
50943 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty-three |
| Binary (base 2) | 1100011011111111 |
| Octal (base 8) | 143377 |
| Hexadecimal (base 16) | C6FF |
| Base 3 | 2120212210 |
| As time | 50943 seconds = 14 h 9 min 3 s |
Is 50943 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 (50943 ÷ 3 = 16981) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50943 a prime number?
No. 50943 = 3 × 16981, so it is divisible by 3.
What are the factors of 50943?
1, 3, 16981, 50943.
What is 50943 in binary?
1100011011111111 (hexadecimal C6FF, octal 143377).
What is the square root of 50943?
About 225.7056.
Is 50943 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50943?
50943 is a semiprime: 3 × 16981, the product of two primes.