The number 95681
95681 is a composite number with 4 divisors. Its prime factorisation is 163 × 587. Divisors (4): 1, 163, 587, 95681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95681: a semiprime: 163 × 587, the product of two primes.
- 2
95681 is composite. Its prime factorisation is
- 3
The divisors add up to 96432; without 95681 itself that is 751, so 95681 is deficient (751 is less than 95681). Euler's totient φ(95681) = 94932 numbers up to 95681 share no factor with it.
- 4
The digits of 95681 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95681 = 163 \times 587 \]
95681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96432 |
| Euler totient φ(n) | 94932 |
| Square | 9154853761 |
| Cube | 875945562706241 |
| Square root | 309.323455 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.5681 × |
95681 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and eighty-one |
| Binary (base 2) | 10111010111000001 |
| Octal (base 8) | 272701 |
| Hexadecimal (base 16) | 175C1 |
| Base 3 | 11212020202 |
| As time | 95681 seconds = 26 h 34 min 41 s |
Is 95681 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 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 1) | 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 3) | 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 95681 a prime number?
No. 95681 = 163 × 587, so it is divisible by 163.
What are the factors of 95681?
1, 163, 587, 95681.
What is 95681 in binary?
10111010111000001 (hexadecimal 175C1, octal 272701).
What is the square root of 95681?
About 309.3235.
Is 95681 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 95681?
95681 is a semiprime: 163 × 587, the product of two primes.