The number 50368
50368 is a composite number with 14 divisors. Its prime factorisation is × 787. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 787, 1574, 3148, 6296, 12592, 25184, 50368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50368 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50368 is composite. Its prime factorisation is
- 3
The divisors add up to 100076; without 50368 itself that is 49708, so 50368 is deficient (49708 is less than 50368). Euler's totient φ(50368) = 25152 numbers up to 50368 share no factor with it.
- 4
The digits of 50368 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50368 = 2^{6} \times 787 \]50368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 100076 |
| Euler totient φ(n) | 25152 |
| Square | 2536935424 |
| Cube | 127780363436032 |
| Square root | 224.428162 (= 8√787) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0368 × |
50368 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-eight |
| Binary (base 2) | 1100010011000000 |
| Octal (base 8) | 142300 |
| Hexadecimal (base 16) | C4C0 |
| Base 3 | 2120002111 |
| As time | 50368 seconds = 13 h 59 min 28 s |
Is 50368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50368 ÷ 2 = 25184) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50368 ÷ 4 = 12592) | 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 4) | 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 | Yes (50368 ÷ 8 = 6296) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50368 a prime number?
No. 50368 = × 787, so it is divisible by 2.
What are the factors of 50368?
1, 2, 4, 8, 16, 32, 64, 787, 1574, 3148, 6296, 12592, 25184, 50368.
What is 50368 in binary?
1100010011000000 (hexadecimal C4C0, octal 142300).
What is the square root of 50368?
About 224.4282, exactly 8√787.
Is 50368 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50368?
It is a composite number with 14 divisors.