The number 82141
82141 is a twin prime (82139 and 82141 are both prime) and the 8031st prime number. Its only divisors are 1 and 82141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82141: a twin prime (82139 and 82141 are both prime); the 8031st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
82141 is prime, so its only factors are 1 and 82141. It is the 8031st prime; the next prime is 82153 and the one before is 82139.
- 3
The divisors add up to 82142; without 82141 itself that is 1, so 82141 is deficient (1 is less than 82141). Euler's totient φ(82141) = 82140 numbers up to 82141 share no factor with it.
- 4
The digits of 82141 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 151 steps to reach 1.
82141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 82142 |
| Euler totient φ(n) | 82140 |
| Square | 6747143881 |
| Cube | 554217145529221 |
| Square root | 286.602512 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2141 × |
82141 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand one hundred and forty-one |
| Binary (base 2) | 10100000011011101 |
| Octal (base 8) | 240335 |
| Hexadecimal (base 16) | 140DD |
| Base 3 | 11011200021 |
| As time | 82141 seconds = 22 h 49 min 1 s |
Is 82141 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 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 4) | 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 82141 a prime number?
Yes. 82141 is divisible only by 1 and itself.
What are the factors of 82141?
1, 82141.
What is 82141 in binary?
10100000011011101 (hexadecimal 140DD, octal 240335).
What is the square root of 82141?
About 286.6025.
Is 82141 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 82141?
82141 is a twin prime (82139 and 82141 are both prime); the 8031st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.