The number 51061
51061 is a twin prime (51059 and 51061 are both prime) and the 5228th prime number. Its only divisors are 1 and 51061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51061: a twin prime (51059 and 51061 are both prime); the 5228th prime number.
- 2
51061 is prime, so its only factors are 1 and 51061. It is the 5228th prime; the next prime is 51071 and the one before is 51059.
- 3
The divisors add up to 51062; without 51061 itself that is 1, so 51061 is deficient (1 is less than 51061). Euler's totient φ(51061) = 51060 numbers up to 51061 share no factor with it.
- 4
The digits of 51061 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
51061 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 51062 |
| Euler totient φ(n) | 51060 |
| Square | 2607225721 |
| Cube | 133127552539981 |
| Square root | 225.966812 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1061 × |
51061 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-one |
| Binary (base 2) | 1100011101110101 |
| Octal (base 8) | 143565 |
| Hexadecimal (base 16) | C775 |
| Base 3 | 2121001011 |
| As time | 51061 seconds = 14 h 11 min 1 s |
Is 51061 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 3) | 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 4) | 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 10) | 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 51061 a prime number?
Yes. 51061 is divisible only by 1 and itself.
What are the factors of 51061?
1, 51061.
What is 51061 in binary?
1100011101110101 (hexadecimal C775, octal 143565).
What is the square root of 51061?
About 225.9668.
Is 51061 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51061?
51061 is a twin prime (51059 and 51061 are both prime); the 5228th prime number.