The number 50701
50701 is a composite number with 4 divisors. Its prime factorisation is 7 × 7243. Divisors (4): 1, 7, 7243, 50701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50701: a semiprime: 7 × 7243, the product of two primes.
- 2
50701 is composite. Its prime factorisation is
- 3
The divisors add up to 57952; without 50701 itself that is 7251, so 50701 is deficient (7251 is less than 50701). Euler's totient φ(50701) = 43452 numbers up to 50701 share no factor with it.
- 4
The digits of 50701 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50701 = 7 \times 7243 \]
50701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57952 |
| Euler totient φ(n) | 43452 |
| Square | 2570591401 |
| Cube | 130331554622101 |
| Square root | 225.168826 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0701 × |
50701 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and one |
| Binary (base 2) | 1100011000001101 |
| Octal (base 8) | 143015 |
| Hexadecimal (base 16) | C60D |
| Base 3 | 2120112211 |
| As time | 50701 seconds = 14 h 5 min 1 s |
Is 50701 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50701 ÷ 7 = 7243) | 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 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50701 a prime number?
No. 50701 = 7 × 7243, so it is divisible by 7.
What are the factors of 50701?
1, 7, 7243, 50701.
What is 50701 in binary?
1100011000001101 (hexadecimal C60D, octal 143015).
What is the square root of 50701?
About 225.1688.
Is 50701 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50701?
50701 is a semiprime: 7 × 7243, the product of two primes.