The number 95797
95797 is a composite number with 4 divisors. Its prime factorisation is 13 × 7369. Divisors (4): 1, 13, 7369, 95797.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95797: a semiprime: 13 × 7369, the product of two primes.
- 2
95797 is composite. Its prime factorisation is
- 3
The divisors add up to 103180; without 95797 itself that is 7383, so 95797 is deficient (7383 is less than 95797). Euler's totient φ(95797) = 88416 numbers up to 95797 share no factor with it.
- 4
The digits of 95797 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95797 = 13 \times 7369 \]
95797 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 103180 |
| Euler totient φ(n) | 88416 |
| Square | 9177065209 |
| Cube | 879135315826573 |
| Square root | 309.510904 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5797 × |
95797 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand seven hundred and ninety-seven |
| Binary (base 2) | 10111011000110101 |
| Octal (base 8) | 273065 |
| Hexadecimal (base 16) | 17635 |
| Base 3 | 11212102001 |
| As time | 95797 seconds = 26 h 36 min 37 s |
Is 95797 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95797 a prime number?
No. 95797 = 13 × 7369, so it is divisible by 13.
What are the factors of 95797?
1, 13, 7369, 95797.
What is 95797 in binary?
10111011000110101 (hexadecimal 17635, octal 273065).
What is the square root of 95797?
About 309.5109.
Is 95797 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 95797?
95797 is a semiprime: 13 × 7369, the product of two primes.