The number 51182
51182 is a composite number with 8 divisors. Its prime factorisation is 2 × 157 × 163. Divisors (8): 1, 2, 157, 163, 314, 326, 25591, 51182.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51182 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51182 is composite. Its prime factorisation is
- 3
The divisors add up to 77736; without 51182 itself that is 26554, so 51182 is deficient (26554 is less than 51182). Euler's totient φ(51182) = 25272 numbers up to 51182 share no factor with it.
- 4
The digits of 51182 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51182 = 2 \times 157 \times 163 \]
51182 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77736 |
| Euler totient φ(n) | 25272 |
| Square | 2619597124 |
| Cube | 134076220000568 |
| Square root | 226.234392 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1182 × |
51182 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and eighty-two |
| Binary (base 2) | 1100011111101110 |
| Octal (base 8) | 143756 |
| Hexadecimal (base 16) | C7EE |
| Base 3 | 2121012122 |
| As time | 51182 seconds = 14 h 13 min 2 s |
Is 51182 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51182 ÷ 2 = 25591) | 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 5) | 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 8) | 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 10) | 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 51182 a prime number?
No. 51182 = 2 × 157 × 163, so it is divisible by 2.
What are the factors of 51182?
1, 2, 157, 163, 314, 326, 25591, 51182.
What is 51182 in binary?
1100011111101110 (hexadecimal C7EE, octal 143756).
What is the square root of 51182?
About 226.2344.
Is 51182 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51182?
It is a composite number with 8 divisors.