The number 50691
50691 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 277. Divisors (8): 1, 3, 61, 183, 277, 831, 16897, 50691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50691 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50691 is composite. Its prime factorisation is
- 3
The divisors add up to 68944; without 50691 itself that is 18253, so 50691 is deficient (18253 is less than 50691). Euler's totient φ(50691) = 33120 numbers up to 50691 share no factor with it.
- 4
The digits of 50691 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50691 = 3 \times 61 \times 277 \]
50691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68944 |
| Euler totient φ(n) | 33120 |
| Square | 2569577481 |
| Cube | 130254452089371 |
| Square root | 225.146619 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0691 × |
50691 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and ninety-one |
| Binary (base 2) | 1100011000000011 |
| Octal (base 8) | 143003 |
| Hexadecimal (base 16) | C603 |
| Base 3 | 2120112110 |
| As time | 50691 seconds = 14 h 4 min 51 s |
Is 50691 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 (50691 ÷ 3 = 16897) | 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 4) | 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 3) | 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 3) | 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 50691 a prime number?
No. 50691 = 3 × 61 × 277, so it is divisible by 3.
What are the factors of 50691?
1, 3, 61, 183, 277, 831, 16897, 50691.
What is 50691 in binary?
1100011000000011 (hexadecimal C603, octal 143003).
What is the square root of 50691?
About 225.1466.
Is 50691 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50691?
It is a composite number with 8 divisors.