The number 51161
51161 is a composite number with 4 divisors. Its prime factorisation is 11 × 4651. Divisors (4): 1, 11, 4651, 51161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51161: a semiprime: 11 × 4651, the product of two primes.
- 2
51161 is composite. Its prime factorisation is
- 3
The divisors add up to 55824; without 51161 itself that is 4663, so 51161 is deficient (4663 is less than 51161). Euler's totient φ(51161) = 46500 numbers up to 51161 share no factor with it.
- 4
The digits of 51161 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51161 = 11 \times 4651 \]
51161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55824 |
| Euler totient φ(n) | 46500 |
| Square | 2617447921 |
| Cube | 133911253086281 |
| Square root | 226.187975 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1161 × |
51161 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and sixty-one |
| Binary (base 2) | 1100011111011001 |
| Octal (base 8) | 143731 |
| Hexadecimal (base 16) | C7D9 |
| Base 3 | 2121011212 |
| As time | 51161 seconds = 14 h 12 min 41 s |
Is 51161 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 2) | 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 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51161 ÷ 11 = 4651) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51161 a prime number?
No. 51161 = 11 × 4651, so it is divisible by 11.
What are the factors of 51161?
1, 11, 4651, 51161.
What is 51161 in binary?
1100011111011001 (hexadecimal C7D9, octal 143731).
What is the square root of 51161?
About 226.1880.
Is 51161 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51161?
51161 is a semiprime: 11 × 4651, the product of two primes.