The number 50823
50823 is a composite number with 6 divisors. Its prime factorisation is × 5647. Divisors (6): 1, 3, 9, 5647, 16941, 50823.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50823 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50823 is composite. Its prime factorisation is
- 3
The divisors add up to 73424; without 50823 itself that is 22601, so 50823 is deficient (22601 is less than 50823). Euler's totient φ(50823) = 33876 numbers up to 50823 share no factor with it.
- 4
The digits of 50823 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50823 = 3^{2} \times 5647 \]50823 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73424 |
| Euler totient φ(n) | 33876 |
| Square | 2582977329 |
| Cube | 131274656791767 |
| Square root | 225.439571 (= 3√5647) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0823 × |
50823 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and twenty-three |
| Binary (base 2) | 1100011010000111 |
| Octal (base 8) | 143207 |
| Hexadecimal (base 16) | C687 |
| Base 3 | 2120201100 |
| As time | 50823 seconds = 14 h 7 min 3 s |
Is 50823 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 (50823 ÷ 3 = 16941) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50823 ÷ 9 = 5647) | 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 3) | 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 50823 a prime number?
No. 50823 = × 5647, so it is divisible by 3.
What are the factors of 50823?
1, 3, 9, 5647, 16941, 50823.
What is 50823 in binary?
1100011010000111 (hexadecimal C687, octal 143207).
What is the square root of 50823?
About 225.4396, exactly 3√5647.
Is 50823 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50823?
It is a composite number with 6 divisors.