The number 50614
50614 is a composite number with 4 divisors. Its prime factorisation is 2 × 25307. Divisors (4): 1, 2, 25307, 50614.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50614: a semiprime: 2 × 25307, the product of two primes.
- 2
50614 is composite. Its prime factorisation is
- 3
The divisors add up to 75924; without 50614 itself that is 25310, so 50614 is deficient (25310 is less than 50614). Euler's totient φ(50614) = 25306 numbers up to 50614 share no factor with it.
- 4
The digits of 50614 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
\[ 50614 = 2 \times 25307 \]
50614 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 75924 |
| Euler totient φ(n) | 25306 |
| Square | 2561776996 |
| Cube | 129661780875544 |
| Square root | 224.975554 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0614 × |
50614 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and fourteen |
| Binary (base 2) | 1100010110110110 |
| Octal (base 8) | 142666 |
| Hexadecimal (base 16) | C5B6 |
| Base 3 | 2120102121 |
| As time | 50614 seconds = 14 h 3 min 34 s |
Is 50614 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50614 ÷ 2 = 25307) | 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 2) | 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 4) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50614 a prime number?
No. 50614 = 2 × 25307, so it is divisible by 2.
What are the factors of 50614?
1, 2, 25307, 50614.
What is 50614 in binary?
1100010110110110 (hexadecimal C5B6, octal 142666).
What is the square root of 50614?
About 224.9756.
Is 50614 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50614?
50614 is a semiprime: 2 × 25307, the product of two primes.