The number 50991
50991 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 739. Divisors (8): 1, 3, 23, 69, 739, 2217, 16997, 50991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50991: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50991 is composite. Its prime factorisation is
- 3
The divisors add up to 71040; without 50991 itself that is 20049, so 50991 is deficient (20049 is less than 50991). Euler's totient φ(50991) = 32472 numbers up to 50991 share no factor with it.
- 4
The digits of 50991 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50991 = 3 \times 23 \times 739 \]
50991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71040 |
| Euler totient φ(n) | 32472 |
| Square | 2600082081 |
| Cube | 132580785392271 |
| Square root | 225.811869 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0991 × |
50991 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and ninety-one |
| Binary (base 2) | 1100011100101111 |
| Octal (base 8) | 143457 |
| Hexadecimal (base 16) | C72F |
| Base 3 | 2120221120 |
| As time | 50991 seconds = 14 h 9 min 51 s |
Is 50991 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 (50991 ÷ 3 = 16997) | 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 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 | No (remainder 7) | 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 6) | 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 50991 a prime number?
No. 50991 = 3 × 23 × 739, so it is divisible by 3.
What are the factors of 50991?
1, 3, 23, 69, 739, 2217, 16997, 50991.
What is 50991 in binary?
1100011100101111 (hexadecimal C72F, octal 143457).
What is the square root of 50991?
About 225.8119.
Is 50991 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50991?
50991 is a happy number: repeatedly adding the squares of its digits reaches 1.