The number 95715
95715 is a composite number with 16 divisors. Its prime factorisation is × 5 × 709. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 709, 2127, 3545, 6381, 10635, 19143, 31905, 95715.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95715: a Harshad number: divisible by its digit sum 27.
- 2
95715 is composite. Its prime factorisation is
- 3
The divisors add up to 170400; without 95715 itself that is 74685, so 95715 is deficient (74685 is less than 95715). Euler's totient φ(95715) = 50976 numbers up to 95715 share no factor with it.
- 4
The digits of 95715 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95715 = 3^{3} \times 5 \times 709 \]95715 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 170400 |
| Euler totient φ(n) | 50976 |
| Square | 9161361225 |
| Cube | 876879689650875 |
| Square root | 309.378409 (= 3√10635) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5715 × |
95715 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand seven hundred and fifteen |
| Binary (base 2) | 10111010111100011 |
| Octal (base 8) | 272743 |
| Hexadecimal (base 16) | 175E3 |
| Base 3 | 11212022000 |
| As time | 95715 seconds = 26 h 35 min 15 s |
Is 95715 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 (95715 ÷ 3 = 31905) | 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 (95715 ÷ 5 = 19143) | 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 4) | 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 | Yes (95715 ÷ 9 = 10635) | 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 4) | 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 95715 a prime number?
No. 95715 = × 5 × 709, so it is divisible by 3.
What are the factors of 95715?
1, 3, 5, 9, 15, 27, 45, 135, 709, 2127, 3545, 6381, 10635, 19143, 31905, 95715.
What is 95715 in binary?
10111010111100011 (hexadecimal 175E3, octal 272743).
What is the square root of 95715?
About 309.3784, exactly 3√10635.
Is 95715 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95715?
95715 is a Harshad number: divisible by its digit sum 27.