The number 59011
59011 is a twin prime (59009 and 59011 are both prime) and the 5965th prime number. Its only divisors are 1 and 59011.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59011: a twin prime (59009 and 59011 are both prime); the 5965th prime number.
- 2
59011 is prime, so its only factors are 1 and 59011. It is the 5965th prime; the next prime is 59021 and the one before is 59009.
- 3
The divisors add up to 59012; without 59011 itself that is 1, so 59011 is deficient (1 is less than 59011). Euler's totient φ(59011) = 59010 numbers up to 59011 share no factor with it.
- 4
The digits of 59011 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 135 steps to reach 1.
59011 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 59012 |
| Euler totient φ(n) | 59010 |
| Square | 3482298121 |
| Cube | 205493894418331 |
| Square root | 242.921798 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9011 × |
59011 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and eleven |
| Binary (base 2) | 1110011010000011 |
| Octal (base 8) | 163203 |
| Hexadecimal (base 16) | E683 |
| Base 3 | 2222221121 |
| As time | 59011 seconds = 16 h 23 min 31 s |
Is 59011 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 3) | 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 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 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59011 a prime number?
Yes. 59011 is divisible only by 1 and itself.
What are the factors of 59011?
1, 59011.
What is 59011 in binary?
1110011010000011 (hexadecimal E683, octal 163203).
What is the square root of 59011?
About 242.9218.
Is 59011 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 59011?
59011 is a twin prime (59009 and 59011 are both prime); the 5965th prime number.