The number 95871
95871 is a composite number with 4 divisors. Its prime factorisation is 3 × 31957. Divisors (4): 1, 3, 31957, 95871.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95871: a semiprime: 3 × 31957, the product of two primes.
- 2
95871 is composite. Its prime factorisation is
- 3
The divisors add up to 127832; without 95871 itself that is 31961, so 95871 is deficient (31961 is less than 95871). Euler's totient φ(95871) = 63912 numbers up to 95871 share no factor with it.
- 4
The digits of 95871 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95871 = 3 \times 31957 \]
95871 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 127832 |
| Euler totient φ(n) | 63912 |
| Square | 9191248641 |
| Cube | 881174198461311 |
| Square root | 309.630425 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5871 × |
95871 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand eight hundred and seventy-one |
| Binary (base 2) | 10111011001111111 |
| Octal (base 8) | 273177 |
| Hexadecimal (base 16) | 1767F |
| Base 3 | 11212111210 |
| As time | 95871 seconds = 26 h 37 min 51 s |
Is 95871 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 (95871 ÷ 3 = 31957) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 6) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95871 a prime number?
No. 95871 = 3 × 31957, so it is divisible by 3.
What are the factors of 95871?
1, 3, 31957, 95871.
What is 95871 in binary?
10111011001111111 (hexadecimal 1767F, octal 273177).
What is the square root of 95871?
About 309.6304.
Is 95871 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95871?
95871 is a semiprime: 3 × 31957, the product of two primes.