The number 50931
50931 is a composite number with 6 divisors. Its prime factorisation is × 5659. Divisors (6): 1, 3, 9, 5659, 16977, 50931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50931 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50931 is composite. Its prime factorisation is
- 3
The divisors add up to 73580; without 50931 itself that is 22649, so 50931 is deficient (22649 is less than 50931). Euler's totient φ(50931) = 33948 numbers up to 50931 share no factor with it.
- 4
The digits of 50931 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50931 = 3^{2} \times 5659 \]50931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73580 |
| Euler totient φ(n) | 33948 |
| Square | 2593966761 |
| Cube | 132113321104491 |
| Square root | 225.678976 (= 3√5659) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0931 × |
50931 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-one |
| Binary (base 2) | 1100011011110011 |
| Octal (base 8) | 143363 |
| Hexadecimal (base 16) | C6F3 |
| Base 3 | 2120212100 |
| As time | 50931 seconds = 14 h 8 min 51 s |
Is 50931 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 (50931 ÷ 3 = 16977) | 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 1) | 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 6) | 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 | Yes (50931 ÷ 9 = 5659) | 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 1) | 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 50931 a prime number?
No. 50931 = × 5659, so it is divisible by 3.
What are the factors of 50931?
1, 3, 9, 5659, 16977, 50931.
What is 50931 in binary?
1100011011110011 (hexadecimal C6F3, octal 143363).
What is the square root of 50931?
About 225.6790, exactly 3√5659.
Is 50931 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50931?
It is a composite number with 6 divisors.