The number 95615
95615 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 1471. Divisors (8): 1, 5, 13, 65, 1471, 7355, 19123, 95615.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95615 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95615 is composite. Its prime factorisation is
- 3
The divisors add up to 123648; without 95615 itself that is 28033, so 95615 is deficient (28033 is less than 95615). Euler's totient φ(95615) = 70560 numbers up to 95615 share no factor with it.
- 4
The digits of 95615 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95615 = 5 \times 13 \times 1471 \]
95615 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 123648 |
| Euler totient φ(n) | 70560 |
| Square | 9142228225 |
| Cube | 874134151733375 |
| Square root | 309.216752 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5615 × |
95615 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and fifteen |
| Binary (base 2) | 10111010101111111 |
| Octal (base 8) | 272577 |
| Hexadecimal (base 16) | 1757F |
| Base 3 | 11212011022 |
| As time | 95615 seconds = 26 h 33 min 35 s |
Is 95615 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 | Yes (95615 ÷ 5 = 19123) | 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 2) | 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 8) | 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 3) | 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 95615 a prime number?
No. 95615 = 5 × 13 × 1471, so it is divisible by 5.
What are the factors of 95615?
1, 5, 13, 65, 1471, 7355, 19123, 95615.
What is 95615 in binary?
10111010101111111 (hexadecimal 1757F, octal 272577).
What is the square root of 95615?
About 309.2168.
Is 95615 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 95615?
It is a composite number with 8 divisors.