The number 51181
51181 is a composite number with 8 divisors. Its prime factorisation is 13 × 31 × 127. Divisors (8): 1, 13, 31, 127, 403, 1651, 3937, 51181.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51181 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51181 is composite. Its prime factorisation is
- 3
The divisors add up to 57344; without 51181 itself that is 6163, so 51181 is deficient (6163 is less than 51181). Euler's totient φ(51181) = 45360 numbers up to 51181 share no factor with it.
- 4
The digits of 51181 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51181 = 13 \times 31 \times 127 \]
51181 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57344 |
| Euler totient φ(n) | 45360 |
| Square | 2619494761 |
| Cube | 134068361362741 |
| Square root | 226.232182 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1181 × |
51181 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and eighty-one |
| Binary (base 2) | 1100011111101101 |
| Octal (base 8) | 143755 |
| Hexadecimal (base 16) | C7ED |
| Base 3 | 2121012121 |
| As time | 51181 seconds = 14 h 13 min 1 s |
Is 51181 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51181 a prime number?
No. 51181 = 13 × 31 × 127, so it is divisible by 13.
What are the factors of 51181?
1, 13, 31, 127, 403, 1651, 3937, 51181.
What is 51181 in binary?
1100011111101101 (hexadecimal C7ED, octal 143755).
What is the square root of 51181?
About 226.2322.
Is 51181 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51181?
It is a composite number with 8 divisors.