The number 51062
51062 is a composite number with 12 divisors. Its prime factorisation is 2 × × 211. Divisors (12): 1, 2, 11, 22, 121, 211, 242, 422, 2321, 4642, 25531, 51062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51062 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51062 is composite. Its prime factorisation is
- 3
The divisors add up to 84588; without 51062 itself that is 33526, so 51062 is deficient (33526 is less than 51062). Euler's totient φ(51062) = 23100 numbers up to 51062 share no factor with it.
- 4
The digits of 51062 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51062 = 2 \times 11^{2} \times 211 \]51062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 84588 |
| Euler totient φ(n) | 23100 |
| Square | 2607327844 |
| Cube | 133135374370328 |
| Square root | 225.969024 (= 11√422) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1062 × |
51062 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-two |
| Binary (base 2) | 1100011101110110 |
| Octal (base 8) | 143566 |
| Hexadecimal (base 16) | C776 |
| Base 3 | 2121001012 |
| As time | 51062 seconds = 14 h 11 min 2 s |
Is 51062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51062 ÷ 2 = 25531) | 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 | No (remainder 2) | 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 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 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 | Yes (51062 ÷ 11 = 4642) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51062 a prime number?
No. 51062 = 2 × × 211, so it is divisible by 2.
What are the factors of 51062?
1, 2, 11, 22, 121, 211, 242, 422, 2321, 4642, 25531, 51062.
What is 51062 in binary?
1100011101110110 (hexadecimal C776, octal 143566).
What is the square root of 51062?
About 225.9690, exactly 11√422.
Is 51062 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51062?
It is a composite number with 12 divisors.