The number 50704
50704 is a composite number with 10 divisors. Its prime factorisation is × 3169. Divisors (10): 1, 2, 4, 8, 16, 3169, 6338, 12676, 25352, 50704.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50704: a Harshad number: divisible by its digit sum 16.
- 2
50704 is composite. Its prime factorisation is
- 3
The divisors add up to 98270; without 50704 itself that is 47566, so 50704 is deficient (47566 is less than 50704). Euler's totient φ(50704) = 25344 numbers up to 50704 share no factor with it.
- 4
The digits of 50704 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50704 = 2^{4} \times 3169 \]50704 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 98270 |
| Euler totient φ(n) | 25344 |
| Square | 2570895616 |
| Cube | 130354691313664 |
| Square root | 225.175487 (= 4√3169) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0704 × |
50704 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and four |
| Binary (base 2) | 1100011000010000 |
| Octal (base 8) | 143020 |
| Hexadecimal (base 16) | C610 |
| Base 3 | 2120112221 |
| As time | 50704 seconds = 14 h 5 min 4 s |
Is 50704 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50704 ÷ 2 = 25352) | 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 (50704 ÷ 4 = 12676) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | Yes (50704 ÷ 8 = 6338) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 50704 a prime number?
No. 50704 = × 3169, so it is divisible by 2.
What are the factors of 50704?
1, 2, 4, 8, 16, 3169, 6338, 12676, 25352, 50704.
What is 50704 in binary?
1100011000010000 (hexadecimal C610, octal 143020).
What is the square root of 50704?
About 225.1755, exactly 4√3169.
Is 50704 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50704?
50704 is a Harshad number: divisible by its digit sum 16.