The number 50752
50752 is a composite number with 28 divisors. Its prime factorisation is × 13 × 61. Divisors (28): 1, 2, 4, 8, 13, 16, 26, 32, 52, 61, 64, 104, 122, 208, 244, 416 … 50752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50752: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50752 is composite. Its prime factorisation is
- 3
The divisors add up to 110236; without 50752 itself that is 59484, so 50752 is abundant (59484 is more than 50752). Euler's totient φ(50752) = 23040 numbers up to 50752 share no factor with it.
- 4
The digits of 50752 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50752 = 2^{6} \times 13 \times 61 \]50752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 110236 |
| Euler totient φ(n) | 23040 |
| Square | 2575765504 |
| Cube | 130725250859008 |
| Square root | 225.282045 (= 8√793) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0752 × |
50752 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and fifty-two |
| Binary (base 2) | 1100011001000000 |
| Octal (base 8) | 143100 |
| Hexadecimal (base 16) | C640 |
| Base 3 | 2120121201 |
| As time | 50752 seconds = 14 h 5 min 52 s |
Is 50752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50752 ÷ 2 = 25376) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50752 ÷ 4 = 12688) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (50752 ÷ 8 = 6344) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50752 a prime number?
No. 50752 = × 13 × 61, so it is divisible by 2.
What are the factors of 50752?
1, 2, 4, 8, 13, 16, 26, 32, 52, 61, 64, 104, 122, 208, 244, 416, 488, 793, 832, 976, 1586, 1952, 3172, 3904, 6344, 12688, 25376, 50752.
What is 50752 in binary?
1100011001000000 (hexadecimal C640, octal 143100).
What is the square root of 50752?
About 225.2820, exactly 8√793.
Is 50752 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50752?
50752 is a happy number: repeatedly adding the squares of its digits reaches 1.