The number 95693
95693 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 433. Divisors (8): 1, 13, 17, 221, 433, 5629, 7361, 95693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95693 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95693 is composite. Its prime factorisation is
- 3
The divisors add up to 109368; without 95693 itself that is 13675, so 95693 is deficient (13675 is less than 95693). Euler's totient φ(95693) = 82944 numbers up to 95693 share no factor with it.
- 4
The digits of 95693 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95693 = 13 \times 17 \times 433 \]
95693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109368 |
| Euler totient φ(n) | 82944 |
| Square | 9157150249 |
| Cube | 876275178777557 |
| Square root | 309.342852 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5693 × |
95693 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and ninety-three |
| Binary (base 2) | 10111010111001101 |
| Octal (base 8) | 272715 |
| Hexadecimal (base 16) | 175CD |
| Base 3 | 11212021012 |
| As time | 95693 seconds = 26 h 34 min 53 s |
Is 95693 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95693 a prime number?
No. 95693 = 13 × 17 × 433, so it is divisible by 13.
What are the factors of 95693?
1, 13, 17, 221, 433, 5629, 7361, 95693.
What is 95693 in binary?
10111010111001101 (hexadecimal 175CD, octal 272715).
What is the square root of 95693?
About 309.3429.
Is 95693 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 95693?
It is a composite number with 8 divisors.