The number 50391
50391 is a composite number with 12 divisors. Its prime factorisation is × 11 × 509. Divisors (12): 1, 3, 9, 11, 33, 99, 509, 1527, 4581, 5599, 16797, 50391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50391 is composite. Its prime factorisation is
- 3
The divisors add up to 79560; without 50391 itself that is 29169, so 50391 is deficient (29169 is less than 50391). Euler's totient φ(50391) = 30480 numbers up to 50391 share no factor with it.
- 4
The digits of 50391 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50391 = 3^{2} \times 11 \times 509 \]50391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79560 |
| Euler totient φ(n) | 30480 |
| Square | 2539252881 |
| Cube | 127955491926471 |
| Square root | 224.479398 (= 3√5599) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.0391 × |
50391 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and ninety-one |
| Binary (base 2) | 1100010011010111 |
| Octal (base 8) | 142327 |
| Hexadecimal (base 16) | C4D7 |
| Base 3 | 2120010100 |
| As time | 50391 seconds = 13 h 59 min 51 s |
Is 50391 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50391 ÷ 3 = 16797) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50391 ÷ 9 = 5599) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50391 ÷ 11 = 4581) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50391 a prime number?
No. 50391 = × 11 × 509, so it is divisible by 3.
What are the factors of 50391?
1, 3, 9, 11, 33, 99, 509, 1527, 4581, 5599, 16797, 50391.
What is 50391 in binary?
1100010011010111 (hexadecimal C4D7, octal 142327).
What is the square root of 50391?
About 224.4794, exactly 3√5599.
Is 50391 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50391?
It is a composite number with 12 divisors.