The number 95613
95613 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 29 × 157. Divisors (16): 1, 3, 7, 21, 29, 87, 157, 203, 471, 609, 1099, 3297, 4553, 13659, 31871, 95613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95613 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95613 is composite. Its prime factorisation is
- 3
The divisors add up to 151680; without 95613 itself that is 56067, so 95613 is deficient (56067 is less than 95613). Euler's totient φ(95613) = 52416 numbers up to 95613 share no factor with it.
- 4
The digits of 95613 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95613 = 3 \times 7 \times 29 \times 157 \]
95613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 151680 |
| Euler totient φ(n) | 52416 |
| Square | 9141845769 |
| Cube | 874079299511397 |
| Square root | 309.213518 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5613 × |
95613 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and thirteen |
| Binary (base 2) | 10111010101111101 |
| Octal (base 8) | 272575 |
| Hexadecimal (base 16) | 1757D |
| Base 3 | 11212011020 |
| As time | 95613 seconds = 26 h 33 min 33 s |
Is 95613 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 (95613 ÷ 3 = 31871) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | Yes (95613 ÷ 7 = 13659) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95613 a prime number?
No. 95613 = 3 × 7 × 29 × 157, so it is divisible by 3.
What are the factors of 95613?
1, 3, 7, 21, 29, 87, 157, 203, 471, 609, 1099, 3297, 4553, 13659, 31871, 95613.
What is 95613 in binary?
10111010101111101 (hexadecimal 1757D, octal 272575).
What is the square root of 95613?
About 309.2135.
Is 95613 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 95613?
It is a composite number with 16 divisors.