The number 50304
50304 is a composite number with 32 divisors. Its prime factorisation is × 3 × 131. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 131, 192 … 50304.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50304: a Harshad number: divisible by its digit sum 12.
- 2
50304 is composite. Its prime factorisation is
- 3
The divisors add up to 134640; without 50304 itself that is 84336, so 50304 is abundant (84336 is more than 50304). Euler's totient φ(50304) = 16640 numbers up to 50304 share no factor with it.
- 4
The digits of 50304 add up to 12, 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
\[ 50304 = 2^{7} \times 3 \times 131 \]50304 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 134640 |
| Euler totient φ(n) | 16640 |
| Square | 2530492416 |
| Cube | 127293890494464 |
| Square root | 224.285532 (= 8√786) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0304 × |
50304 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and four |
| Binary (base 2) | 1100010010000000 |
| Octal (base 8) | 142200 |
| Hexadecimal (base 16) | C480 |
| Base 3 | 2120000010 |
| As time | 50304 seconds = 13 h 58 min 24 s |
Is 50304 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50304 ÷ 2 = 25152) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50304 ÷ 3 = 16768) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50304 ÷ 4 = 12576) | 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 (50304 ÷ 6 = 8384) | 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 | Yes (50304 ÷ 8 = 6288) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50304 ÷ 12 = 4192) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50304 a prime number?
No. 50304 = × 3 × 131, so it is divisible by 2.
What are the factors of 50304?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 131, 192, 262, 384, 393, 524, 786, 1048, 1572, 2096, 3144, 4192, 6288, 8384, 12576, 16768, 25152, 50304.
What is 50304 in binary?
1100010010000000 (hexadecimal C480, octal 142200).
What is the square root of 50304?
About 224.2855, exactly 8√786.
Is 50304 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50304?
50304 is a Harshad number: divisible by its digit sum 12.