The number 50361
50361 is a composite number with 4 divisors. Its prime factorisation is 3 × 16787. Divisors (4): 1, 3, 16787, 50361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50361: a semiprime: 3 × 16787, the product of two primes.
- 2
50361 is composite. Its prime factorisation is
- 3
The divisors add up to 67152; without 50361 itself that is 16791, so 50361 is deficient (16791 is less than 50361). Euler's totient φ(50361) = 33572 numbers up to 50361 share no factor with it.
- 4
The digits of 50361 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50361 = 3 \times 16787 \]
50361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67152 |
| Euler totient φ(n) | 33572 |
| Square | 2536230321 |
| Cube | 127727095195881 |
| Square root | 224.412566 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0361 × |
50361 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-one |
| Binary (base 2) | 1100010010111001 |
| Octal (base 8) | 142271 |
| Hexadecimal (base 16) | C4B9 |
| Base 3 | 2120002020 |
| As time | 50361 seconds = 13 h 59 min 21 s |
Is 50361 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 (50361 ÷ 3 = 16787) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50361 a prime number?
No. 50361 = 3 × 16787, so it is divisible by 3.
What are the factors of 50361?
1, 3, 16787, 50361.
What is 50361 in binary?
1100010010111001 (hexadecimal C4B9, octal 142271).
What is the square root of 50361?
About 224.4126.
Is 50361 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50361?
50361 is a semiprime: 3 × 16787, the product of two primes.