The number 51059
51059 is a twin prime (51059 and 51061 are both prime) and the 5227th prime number. Its only divisors are 1 and 51059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51059: a twin prime (51059 and 51061 are both prime); the 5227th prime number.
- 2
51059 is prime, so its only factors are 1 and 51059. It is the 5227th prime; the next prime is 51061 and the one before is 51047.
- 3
The divisors add up to 51060; without 51059 itself that is 1, so 51059 is deficient (1 is less than 51059). Euler's totient φ(51059) = 51058 numbers up to 51059 share no factor with it.
- 4
The digits of 51059 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
51059 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 51060 |
| Euler totient φ(n) | 51058 |
| Square | 2607021481 |
| Cube | 133111909798379 |
| Square root | 225.962386 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1059 × |
51059 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-nine |
| Binary (base 2) | 1100011101110011 |
| Octal (base 8) | 143563 |
| Hexadecimal (base 16) | C773 |
| Base 3 | 2121001002 |
| As time | 51059 seconds = 14 h 10 min 59 s |
Is 51059 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51059 a prime number?
Yes. 51059 is divisible only by 1 and itself.
What are the factors of 51059?
1, 51059.
What is 51059 in binary?
1100011101110011 (hexadecimal C773, octal 143563).
What is the square root of 51059?
About 225.9624.
Is 51059 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51059?
51059 is a twin prime (51059 and 51061 are both prime); the 5227th prime number.