The number 50091
50091 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 283. Divisors (8): 1, 3, 59, 177, 283, 849, 16697, 50091.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50091 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50091 is composite. Its prime factorisation is
- 3
The divisors add up to 68160; without 50091 itself that is 18069, so 50091 is deficient (18069 is less than 50091). Euler's totient φ(50091) = 32712 numbers up to 50091 share no factor with it.
- 4
The digits of 50091 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50091 = 3 \times 59 \times 283 \]
50091 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68160 |
| Euler totient φ(n) | 32712 |
| Square | 2509108281 |
| Cube | 125683742903571 |
| Square root | 223.810187 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.0091 × |
50091 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and ninety-one |
| Binary (base 2) | 1100001110101011 |
| Octal (base 8) | 141653 |
| Hexadecimal (base 16) | C3AB |
| Base 3 | 2112201020 |
| As time | 50091 seconds = 13 h 54 min 51 s |
Is 50091 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 (50091 ÷ 3 = 16697) | 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 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | No (remainder 8) | 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 50091 a prime number?
No. 50091 = 3 × 59 × 283, so it is divisible by 3.
What are the factors of 50091?
1, 3, 59, 177, 283, 849, 16697, 50091.
What is 50091 in binary?
1100001110101011 (hexadecimal C3AB, octal 141653).
What is the square root of 50091?
About 223.8102.
Is 50091 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50091?
It is a composite number with 8 divisors.