The number 50367
50367 is a composite number with 8 divisors. Its prime factorisation is 3 × 103 × 163. Divisors (8): 1, 3, 103, 163, 309, 489, 16789, 50367.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50367 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50367 is composite. Its prime factorisation is
- 3
The divisors add up to 68224; without 50367 itself that is 17857, so 50367 is deficient (17857 is less than 50367). Euler's totient φ(50367) = 33048 numbers up to 50367 share no factor with it.
- 4
The digits of 50367 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50367 = 3 \times 103 \times 163 \]
50367 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68224 |
| Euler totient φ(n) | 33048 |
| Square | 2536834689 |
| Cube | 127772752780863 |
| Square root | 224.425934 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0367 × |
50367 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-seven |
| Binary (base 2) | 1100010010111111 |
| Octal (base 8) | 142277 |
| Hexadecimal (base 16) | C4BF |
| Base 3 | 2120002110 |
| As time | 50367 seconds = 13 h 59 min 27 s |
Is 50367 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 (50367 ÷ 3 = 16789) | 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 2) | 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 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 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 50367 a prime number?
No. 50367 = 3 × 103 × 163, so it is divisible by 3.
What are the factors of 50367?
1, 3, 103, 163, 309, 489, 16789, 50367.
What is 50367 in binary?
1100010010111111 (hexadecimal C4BF, octal 142277).
What is the square root of 50367?
About 224.4259.
Is 50367 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50367?
It is a composite number with 8 divisors.