The number 50709
50709 is a composite number with 4 divisors. Its prime factorisation is 3 × 16903. Divisors (4): 1, 3, 16903, 50709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50709: a semiprime: 3 × 16903, the product of two primes.
- 2
50709 is composite. Its prime factorisation is
- 3
The divisors add up to 67616; without 50709 itself that is 16907, so 50709 is deficient (16907 is less than 50709). Euler's totient φ(50709) = 33804 numbers up to 50709 share no factor with it.
- 4
The digits of 50709 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50709 = 3 \times 16903 \]
50709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67616 |
| Euler totient φ(n) | 33804 |
| Square | 2571402681 |
| Cube | 130393258550829 |
| Square root | 225.186589 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0709 × |
50709 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and nine |
| Binary (base 2) | 1100011000010101 |
| Octal (base 8) | 143025 |
| Hexadecimal (base 16) | C615 |
| Base 3 | 2120120010 |
| As time | 50709 seconds = 14 h 5 min 9 s |
Is 50709 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 (50709 ÷ 3 = 16903) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50709 a prime number?
No. 50709 = 3 × 16903, so it is divisible by 3.
What are the factors of 50709?
1, 3, 16903, 50709.
What is 50709 in binary?
1100011000010101 (hexadecimal C615, octal 143025).
What is the square root of 50709?
About 225.1866.
Is 50709 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50709?
50709 is a semiprime: 3 × 16903, the product of two primes.