The number 32141
32141 is a twin prime (32141 and 32143 are both prime) and the 3448th prime number. Its only divisors are 1 and 32141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32141: a twin prime (32141 and 32143 are both prime); the 3448th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
32141 is prime, so its only factors are 1 and 32141. It is the 3448th prime; the next prime is 32143 and the one before is 32119.
- 3
The divisors add up to 32142; without 32141 itself that is 1, so 32141 is deficient (1 is less than 32141). Euler's totient φ(32141) = 32140 numbers up to 32141 share no factor with it.
- 4
The digits of 32141 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
32141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 32142 |
| Euler totient φ(n) | 32140 |
| Square | 1033043881 |
| Cube | 33203063379221 |
| Square root | 179.279112 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 28 |
| Scientific notation | 3.2141 × |
32141 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and forty-one |
| Binary (base 2) | 111110110001101 |
| Octal (base 8) | 76615 |
| Hexadecimal (base 16) | 7D8D |
| Base 3 | 1122002102 |
| As time | 32141 seconds = 8 h 55 min 41 s |
Is 32141 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 4) | 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 10) | 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 32141 a prime number?
Yes. 32141 is divisible only by 1 and itself.
What are the factors of 32141?
1, 32141.
What is 32141 in binary?
111110110001101 (hexadecimal 7D8D, octal 76615).
What is the square root of 32141?
About 179.2791.
Is 32141 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 32141?
32141 is a twin prime (32141 and 32143 are both prime); the 3448th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.