The number 95927
95927 is a composite number with 8 divisors. Its prime factorisation is 13 × 47 × 157. Divisors (8): 1, 13, 47, 157, 611, 2041, 7379, 95927.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95927 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95927 is composite. Its prime factorisation is
- 3
The divisors add up to 106176; without 95927 itself that is 10249, so 95927 is deficient (10249 is less than 95927). Euler's totient φ(95927) = 86112 numbers up to 95927 share no factor with it.
- 4
The digits of 95927 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95927 = 13 \times 47 \times 157 \]
95927 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106176 |
| Euler totient φ(n) | 86112 |
| Square | 9201989329 |
| Cube | 882719230362983 |
| Square root | 309.720842 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.5927 × |
95927 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and twenty-seven |
| Binary (base 2) | 10111011010110111 |
| Octal (base 8) | 273267 |
| Hexadecimal (base 16) | 176B7 |
| Base 3 | 11212120212 |
| As time | 95927 seconds = 26 h 38 min 47 s |
Is 95927 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95927 a prime number?
No. 95927 = 13 × 47 × 157, so it is divisible by 13.
What are the factors of 95927?
1, 13, 47, 157, 611, 2041, 7379, 95927.
What is 95927 in binary?
10111011010110111 (hexadecimal 176B7, octal 273267).
What is the square root of 95927?
About 309.7208.
Is 95927 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 95927?
It is a composite number with 8 divisors.