The number 50392
50392 is a composite number with 8 divisors. Its prime factorisation is × 6299. Divisors (8): 1, 2, 4, 8, 6299, 12598, 25196, 50392.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50392 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50392 is composite. Its prime factorisation is
- 3
The divisors add up to 94500; without 50392 itself that is 44108, so 50392 is deficient (44108 is less than 50392). Euler's totient φ(50392) = 25192 numbers up to 50392 share no factor with it.
- 4
The digits of 50392 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50392 = 2^{3} \times 6299 \]50392 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94500 |
| Euler totient φ(n) | 25192 |
| Square | 2539353664 |
| Cube | 127963109836288 |
| Square root | 224.481625 (= 2√12598) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0392 × |
50392 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and ninety-two |
| Binary (base 2) | 1100010011011000 |
| Octal (base 8) | 142330 |
| Hexadecimal (base 16) | C4D8 |
| Base 3 | 2120010101 |
| As time | 50392 seconds = 13 h 59 min 52 s |
Is 50392 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50392 ÷ 2 = 25196) | 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 (50392 ÷ 4 = 12598) | 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 4) | 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 | Yes (50392 ÷ 8 = 6299) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50392 a prime number?
No. 50392 = × 6299, so it is divisible by 2.
What are the factors of 50392?
1, 2, 4, 8, 6299, 12598, 25196, 50392.
What is 50392 in binary?
1100010011011000 (hexadecimal C4D8, octal 142330).
What is the square root of 50392?
About 224.4816, exactly 2√12598.
Is 50392 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50392?
It is a composite number with 8 divisors.