The number 50751
50751 is a composite number with 6 divisors. Its prime factorisation is × 5639. Divisors (6): 1, 3, 9, 5639, 16917, 50751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50751: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50751 is composite. Its prime factorisation is
- 3
The divisors add up to 73320; without 50751 itself that is 22569, so 50751 is deficient (22569 is less than 50751). Euler's totient φ(50751) = 33828 numbers up to 50751 share no factor with it.
- 4
The digits of 50751 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50751 = 3^{2} \times 5639 \]50751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73320 |
| Euler totient φ(n) | 33828 |
| Square | 2575664001 |
| Cube | 130717523714751 |
| Square root | 225.279826 (= 3√5639) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0751 × |
50751 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and fifty-one |
| Binary (base 2) | 1100011000111111 |
| Octal (base 8) | 143077 |
| Hexadecimal (base 16) | C63F |
| Base 3 | 2120121200 |
| As time | 50751 seconds = 14 h 5 min 51 s |
Is 50751 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 (50751 ÷ 3 = 16917) | 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 1) | 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 (50751 ÷ 9 = 5639) | 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 50751 a prime number?
No. 50751 = × 5639, so it is divisible by 3.
What are the factors of 50751?
1, 3, 9, 5639, 16917, 50751.
What is 50751 in binary?
1100011000111111 (hexadecimal C63F, octal 143077).
What is the square root of 50751?
About 225.2798, exactly 3√5639.
Is 50751 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50751?
50751 is a happy number: repeatedly adding the squares of its digits reaches 1.