The number 50364
50364 is a composite number with 18 divisors. Its prime factorisation is × × 1399. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 1399, 2798, 4197, 5596, 8394, 12591, 16788 … 50364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50364: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
50364 is composite. Its prime factorisation is
- 3
The divisors add up to 127400; without 50364 itself that is 77036, so 50364 is abundant (77036 is more than 50364). Euler's totient φ(50364) = 16776 numbers up to 50364 share no factor with it.
- 4
The digits of 50364 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 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50364 = 2^{2} \times 3^{2} \times 1399 \]50364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 127400 |
| Euler totient φ(n) | 16776 |
| Square | 2536532496 |
| Cube | 127749922628544 |
| Square root | 224.419251 (= 6√1399) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0364 × |
50364 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-four |
| Binary (base 2) | 1100010010111100 |
| Octal (base 8) | 142274 |
| Hexadecimal (base 16) | C4BC |
| Base 3 | 2120002100 |
| As time | 50364 seconds = 13 h 59 min 24 s |
Is 50364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50364 ÷ 2 = 25182) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50364 ÷ 3 = 16788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50364 ÷ 4 = 12591) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50364 ÷ 6 = 8394) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50364 ÷ 9 = 5596) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50364 ÷ 12 = 4197) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50364 a prime number?
No. 50364 = × × 1399, so it is divisible by 2.
What are the factors of 50364?
1, 2, 3, 4, 6, 9, 12, 18, 36, 1399, 2798, 4197, 5596, 8394, 12591, 16788, 25182, 50364.
What is 50364 in binary?
1100010010111100 (hexadecimal C4BC, octal 142274).
What is the square root of 50364?
About 224.4193, exactly 6√1399.
Is 50364 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50364?
50364 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.