The number 50312
50312 is a composite number with 16 divisors. Its prime factorisation is × 19 × 331. Divisors (16): 1, 2, 4, 8, 19, 38, 76, 152, 331, 662, 1324, 2648, 6289, 12578, 25156, 50312.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50312 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50312 is composite. Its prime factorisation is
- 3
The divisors add up to 99600; without 50312 itself that is 49288, so 50312 is deficient (49288 is less than 50312). Euler's totient φ(50312) = 23760 numbers up to 50312 share no factor with it.
- 4
The digits of 50312 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50312 = 2^{3} \times 19 \times 331 \]50312 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 99600 |
| Euler totient φ(n) | 23760 |
| Square | 2531297344 |
| Cube | 127354631971328 |
| Square root | 224.303366 (= 2√12578) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0312 × |
50312 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and twelve |
| Binary (base 2) | 1100010010001000 |
| Octal (base 8) | 142210 |
| Hexadecimal (base 16) | C488 |
| Base 3 | 2120000102 |
| As time | 50312 seconds = 13 h 58 min 32 s |
Is 50312 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50312 ÷ 2 = 25156) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50312 ÷ 4 = 12578) | 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 2) | 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 (50312 ÷ 8 = 6289) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50312 a prime number?
No. 50312 = × 19 × 331, so it is divisible by 2.
What are the factors of 50312?
1, 2, 4, 8, 19, 38, 76, 152, 331, 662, 1324, 2648, 6289, 12578, 25156, 50312.
What is 50312 in binary?
1100010010001000 (hexadecimal C488, octal 142210).
What is the square root of 50312?
About 224.3034, exactly 2√12578.
Is 50312 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50312?
It is a composite number with 16 divisors.