The number 95913
95913 is a composite number with 6 divisors. Its prime factorisation is × 10657. Divisors (6): 1, 3, 9, 10657, 31971, 95913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95913 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95913 is composite. Its prime factorisation is
- 3
The divisors add up to 138554; without 95913 itself that is 42641, so 95913 is deficient (42641 is less than 95913). Euler's totient φ(95913) = 63936 numbers up to 95913 share no factor with it.
- 4
The digits of 95913 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95913 = 3^{2} \times 10657 \]95913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 138554 |
| Euler totient φ(n) | 63936 |
| Square | 9199303569 |
| Cube | 882332803213497 |
| Square root | 309.698240 (= 3√10657) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.5913 × |
95913 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and thirteen |
| Binary (base 2) | 10111011010101001 |
| Octal (base 8) | 273251 |
| Hexadecimal (base 16) | 176A9 |
| Base 3 | 11212120100 |
| As time | 95913 seconds = 26 h 38 min 33 s |
Is 95913 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 (95913 ÷ 3 = 31971) | 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 | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (95913 ÷ 9 = 10657) | 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 4) | 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 95913 a prime number?
No. 95913 = × 10657, so it is divisible by 3.
What are the factors of 95913?
1, 3, 9, 10657, 31971, 95913.
What is 95913 in binary?
10111011010101001 (hexadecimal 176A9, octal 273251).
What is the square root of 95913?
About 309.6982, exactly 3√10657.
Is 95913 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95913?
It is a composite number with 6 divisors.