The number 87141
87141 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 937. Divisors (8): 1, 3, 31, 93, 937, 2811, 29047, 87141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
87141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
87141 is composite. Its prime factorisation is
- 3
The divisors add up to 120064; without 87141 itself that is 32923, so 87141 is deficient (32923 is less than 87141). Euler's totient φ(87141) = 56160 numbers up to 87141 share no factor with it.
- 4
The digits of 87141 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 87141 = 3 \times 31 \times 937 \]
87141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 120064 |
| Euler totient φ(n) | 56160 |
| Square | 7593553881 |
| Cube | 661709878744221 |
| Square root | 295.196545 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.7141 × |
87141 in other forms
| Form | Value |
|---|---|
| In words | eighty-seven thousand one hundred and forty-one |
| Binary (base 2) | 10101010001100101 |
| Octal (base 8) | 252145 |
| Hexadecimal (base 16) | 15465 |
| Base 3 | 11102112110 |
| As time | 87141 seconds = 24 h 12 min 21 s |
Is 87141 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 | Yes (87141 ÷ 3 = 29047) | 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 3) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 87141 a prime number?
No. 87141 = 3 × 31 × 937, so it is divisible by 3.
What are the factors of 87141?
1, 3, 31, 93, 937, 2811, 29047, 87141.
What is 87141 in binary?
10101010001100101 (hexadecimal 15465, octal 252145).
What is the square root of 87141?
About 295.1965.
Is 87141 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 87141?
It is a composite number with 8 divisors.