The number 50613
50613 is a composite number with 4 divisors. Its prime factorisation is 3 × 16871. Divisors (4): 1, 3, 16871, 50613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50613: a semiprime: 3 × 16871, the product of two primes.
- 2
50613 is composite. Its prime factorisation is
- 3
The divisors add up to 67488; without 50613 itself that is 16875, so 50613 is deficient (16875 is less than 50613). Euler's totient φ(50613) = 33740 numbers up to 50613 share no factor with it.
- 4
The digits of 50613 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50613 = 3 \times 16871 \]
50613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67488 |
| Euler totient φ(n) | 33740 |
| Square | 2561675769 |
| Cube | 129654095696397 |
| Square root | 224.973332 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0613 × |
50613 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and thirteen |
| Binary (base 2) | 1100010110110101 |
| Octal (base 8) | 142665 |
| Hexadecimal (base 16) | C5B5 |
| Base 3 | 2120102120 |
| As time | 50613 seconds = 14 h 3 min 33 s |
Is 50613 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 (50613 ÷ 3 = 16871) | 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 3) | 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 5) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50613 a prime number?
No. 50613 = 3 × 16871, so it is divisible by 3.
What are the factors of 50613?
1, 3, 16871, 50613.
What is 50613 in binary?
1100010110110101 (hexadecimal C5B5, octal 142665).
What is the square root of 50613?
About 224.9733.
Is 50613 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50613?
50613 is a semiprime: 3 × 16871, the product of two primes.