The number 50612
50612 is a composite number with 6 divisors. Its prime factorisation is × 12653. Divisors (6): 1, 2, 4, 12653, 25306, 50612.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50612 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50612 is composite. Its prime factorisation is
- 3
The divisors add up to 88578; without 50612 itself that is 37966, so 50612 is deficient (37966 is less than 50612). Euler's totient φ(50612) = 25304 numbers up to 50612 share no factor with it.
- 4
The digits of 50612 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50612 = 2^{2} \times 12653 \]50612 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 88578 |
| Euler totient φ(n) | 25304 |
| Square | 2561574544 |
| Cube | 129646410820928 |
| Square root | 224.971109 (= 2√12653) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0612 × |
50612 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and twelve |
| Binary (base 2) | 1100010110110100 |
| Octal (base 8) | 142664 |
| Hexadecimal (base 16) | C5B4 |
| Base 3 | 2120102112 |
| As time | 50612 seconds = 14 h 3 min 32 s |
Is 50612 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50612 ÷ 2 = 25306) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50612 ÷ 4 = 12653) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50612 a prime number?
No. 50612 = × 12653, so it is divisible by 2.
What are the factors of 50612?
1, 2, 4, 12653, 25306, 50612.
What is 50612 in binary?
1100010110110100 (hexadecimal C5B4, octal 142664).
What is the square root of 50612?
About 224.9711, exactly 2√12653.
Is 50612 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50612?
It is a composite number with 6 divisors.