The number 95691
95691 is a composite number with 8 divisors. Its prime factorisation is 3 × 167 × 191. Divisors (8): 1, 3, 167, 191, 501, 573, 31897, 95691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95691 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95691 is composite. Its prime factorisation is
- 3
The divisors add up to 129024; without 95691 itself that is 33333, so 95691 is deficient (33333 is less than 95691). Euler's totient φ(95691) = 63080 numbers up to 95691 share no factor with it.
- 4
The digits of 95691 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95691 = 3 \times 167 \times 191 \]
95691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 129024 |
| Euler totient φ(n) | 63080 |
| Square | 9156767481 |
| Cube | 876220237024371 |
| Square root | 309.339619 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5691 × |
95691 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and ninety-one |
| Binary (base 2) | 10111010111001011 |
| Octal (base 8) | 272713 |
| Hexadecimal (base 16) | 175CB |
| Base 3 | 11212021010 |
| As time | 95691 seconds = 26 h 34 min 51 s |
Is 95691 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 (95691 ÷ 3 = 31897) | 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 1) | 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 3) | 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 2) | 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 95691 a prime number?
No. 95691 = 3 × 167 × 191, so it is divisible by 3.
What are the factors of 95691?
1, 3, 167, 191, 501, 573, 31897, 95691.
What is 95691 in binary?
10111010111001011 (hexadecimal 175CB, octal 272713).
What is the square root of 95691?
About 309.3396.
Is 95691 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95691?
It is a composite number with 8 divisors.