The number 61141
61141 is the 6157th prime number. Its only divisors are 1 and 61141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61141: the 6157th prime number.
- 2
61141 is prime, so its only factors are 1 and 61141. It is the 6157th prime; the next prime is 61151 and the one before is 61129.
- 3
The divisors add up to 61142; without 61141 itself that is 1, so 61141 is deficient (1 is less than 61141). Euler's totient φ(61141) = 61140 numbers up to 61141 share no factor with it.
- 4
The digits of 61141 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 34 steps to reach 1.
61141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 61142 |
| Euler totient φ(n) | 61140 |
| Square | 3738221881 |
| Cube | 228558624026221 |
| Square root | 247.267062 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 34 |
| Scientific notation | 6.1141 × |
61141 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and forty-one |
| Binary (base 2) | 1110111011010101 |
| Octal (base 8) | 167325 |
| Hexadecimal (base 16) | EED5 |
| Base 3 | 10002212111 |
| As time | 61141 seconds = 16 h 59 min 1 s |
Is 61141 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 3) | 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 61141 a prime number?
Yes. 61141 is divisible only by 1 and itself.
What are the factors of 61141?
1, 61141.
What is 61141 in binary?
1110111011010101 (hexadecimal EED5, octal 167325).
What is the square root of 61141?
About 247.2671.
Is 61141 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 61141?
61141 is the 6157th prime number.