The number 51162
51162 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8527. Divisors (8): 1, 2, 3, 6, 8527, 17054, 25581, 51162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51162 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51162 is composite. Its prime factorisation is
- 3
The divisors add up to 102336; without 51162 itself that is 51174, so 51162 is abundant (51174 is more than 51162). Euler's totient φ(51162) = 17052 numbers up to 51162 share no factor with it.
- 4
The digits of 51162 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51162 = 2 \times 3 \times 8527 \]
51162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102336 |
| Euler totient φ(n) | 17052 |
| Square | 2617550244 |
| Cube | 133919105583528 |
| Square root | 226.190185 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1162 × |
51162 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and sixty-two |
| Binary (base 2) | 1100011111011010 |
| Octal (base 8) | 143732 |
| Hexadecimal (base 16) | C7DA |
| Base 3 | 2121011220 |
| As time | 51162 seconds = 14 h 12 min 42 s |
Is 51162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51162 ÷ 2 = 25581) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51162 ÷ 3 = 17054) | 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 | Yes (51162 ÷ 6 = 8527) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51162 a prime number?
No. 51162 = 2 × 3 × 8527, so it is divisible by 2.
What are the factors of 51162?
1, 2, 3, 6, 8527, 17054, 25581, 51162.
What is 51162 in binary?
1100011111011010 (hexadecimal C7DA, octal 143732).
What is the square root of 51162?
About 226.1902.
Is 51162 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51162?
It is a composite number with 8 divisors.