The number 50531
50531 is a composite number with 8 divisors. Its prime factorisation is Ć 23. Divisors (8): 1, 13, 23, 169, 299, 2197, 3887, 50531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50531 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50531 is composite. Its prime factorisation is
- 3
The divisors add up to 57120; without 50531 itself that is 6589, so 50531 is deficient (6589 is less than 50531). Euler's totient Ļ(50531) = 44616 numbers up to 50531 share no factor with it.
- 4
The digits of 50531 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50531 = 13^{3} \times 23 \]50531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57120 |
| Euler totient Ļ(n) | 44616 |
| Square | 2553381961 |
| Cube | 129024943871291 |
| Square root | 224.791014 (= 13ā299) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0531 Ć |
50531 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-one |
| Binary (base 2) | 1100010101100011 |
| Octal (base 8) | 142543 |
| Hexadecimal (base 16) | C563 |
| Base 3 | 2120022112 |
| As time | 50531 seconds = 14 h 2 min 11 s |
Is 50531 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 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 5) | 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 5) | 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 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 50531 a prime number?
No. 50531 = Ć 23, so it is divisible by 13.
What are the factors of 50531?
1, 13, 23, 169, 299, 2197, 3887, 50531.
What is 50531 in binary?
1100010101100011 (hexadecimal C563, octal 142543).
What is the square root of 50531?
About 224.7910, exactly 13ā299.
Is 50531 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50531?
It is a composite number with 8 divisors.