The number 59141
59141 is the 5980th prime number. Its only divisors are 1 and 59141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59141: the 5980th prime number.
- 2
59141 is prime, so its only factors are 1 and 59141. It is the 5980th prime; the next prime is 59149 and the one before is 59123.
- 3
The divisors add up to 59142; without 59141 itself that is 1, so 59141 is deficient (1 is less than 59141). Euler's totient φ(59141) = 59140 numbers up to 59141 share no factor with it.
- 4
The digits of 59141 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 60 steps to reach 1.
59141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 59142 |
| Euler totient φ(n) | 59140 |
| Square | 3497657881 |
| Cube | 206854984740221 |
| Square root | 243.189227 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.9141 × |
59141 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and forty-one |
| Binary (base 2) | 1110011100000101 |
| Octal (base 8) | 163405 |
| Hexadecimal (base 16) | E705 |
| Base 3 | 10000010102 |
| As time | 59141 seconds = 16 h 25 min 41 s |
Is 59141 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 59141 a prime number?
Yes. 59141 is divisible only by 1 and itself.
What are the factors of 59141?
1, 59141.
What is 59141 in binary?
1110011100000101 (hexadecimal E705, octal 163405).
What is the square root of 59141?
About 243.1892.
Is 59141 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 59141?
59141 is the 5980th prime number.