The number 95815
95815 is a composite number with 4 divisors. Its prime factorisation is 5 × 19163. Divisors (4): 1, 5, 19163, 95815.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95815: a semiprime: 5 × 19163, the product of two primes.
- 2
95815 is composite. Its prime factorisation is
- 3
The divisors add up to 114984; without 95815 itself that is 19169, so 95815 is deficient (19169 is less than 95815). Euler's totient φ(95815) = 76648 numbers up to 95815 share no factor with it.
- 4
The digits of 95815 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95815 = 5 \times 19163 \]
95815 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 114984 |
| Euler totient φ(n) | 76648 |
| Square | 9180514225 |
| Cube | 879630970468375 |
| Square root | 309.539981 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5815 × |
95815 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand eight hundred and fifteen |
| Binary (base 2) | 10111011001000111 |
| Octal (base 8) | 273107 |
| Hexadecimal (base 16) | 17647 |
| Base 3 | 11212102201 |
| As time | 95815 seconds = 26 h 36 min 55 s |
Is 95815 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 1) | 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 | Yes (95815 ÷ 5 = 19163) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95815 a prime number?
No. 95815 = 5 × 19163, so it is divisible by 5.
What are the factors of 95815?
1, 5, 19163, 95815.
What is 95815 in binary?
10111011001000111 (hexadecimal 17647, octal 273107).
What is the square root of 95815?
About 309.5400.
Is 95815 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 95815?
95815 is a semiprime: 5 × 19163, the product of two primes.