The number 50739
50739 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1301. Divisors (8): 1, 3, 13, 39, 1301, 3903, 16913, 50739.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50739 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50739 is composite. Its prime factorisation is
- 3
The divisors add up to 72912; without 50739 itself that is 22173, so 50739 is deficient (22173 is less than 50739). Euler's totient φ(50739) = 31200 numbers up to 50739 share no factor with it.
- 4
The digits of 50739 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
\[ 50739 = 3 \times 13 \times 1301 \]
50739 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72912 |
| Euler totient φ(n) | 31200 |
| Square | 2574446121 |
| Cube | 130624821733419 |
| Square root | 225.253191 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0739 × |
50739 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and thirty-nine |
| Binary (base 2) | 1100011000110011 |
| Octal (base 8) | 143063 |
| Hexadecimal (base 16) | C633 |
| Base 3 | 2120121020 |
| As time | 50739 seconds = 14 h 5 min 39 s |
Is 50739 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 (50739 ÷ 3 = 16913) | 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 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 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 50739 a prime number?
No. 50739 = 3 × 13 × 1301, so it is divisible by 3.
What are the factors of 50739?
1, 3, 13, 39, 1301, 3903, 16913, 50739.
What is 50739 in binary?
1100011000110011 (hexadecimal C633, octal 143063).
What is the square root of 50739?
About 225.2532.
Is 50739 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50739?
It is a composite number with 8 divisors.