The number 95943
95943 is a composite number with 4 divisors. Its prime factorisation is 3 × 31981. Divisors (4): 1, 3, 31981, 95943.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95943: a semiprime: 3 × 31981, the product of two primes.
- 2
95943 is composite. Its prime factorisation is
- 3
The divisors add up to 127928; without 95943 itself that is 31985, so 95943 is deficient (31985 is less than 95943). Euler's totient φ(95943) = 63960 numbers up to 95943 share no factor with it.
- 4
The digits of 95943 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95943 = 3 \times 31981 \]
95943 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 127928 |
| Euler totient φ(n) | 63960 |
| Square | 9205059249 |
| Cube | 883160999526807 |
| Square root | 309.746671 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.5943 × |
95943 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and forty-three |
| Binary (base 2) | 10111011011000111 |
| Octal (base 8) | 273307 |
| Hexadecimal (base 16) | 176C7 |
| Base 3 | 11212121110 |
| As time | 95943 seconds = 26 h 39 min 3 s |
Is 95943 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 (95943 ÷ 3 = 31981) | 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 | 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 1) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95943 a prime number?
No. 95943 = 3 × 31981, so it is divisible by 3.
What are the factors of 95943?
1, 3, 31981, 95943.
What is 95943 in binary?
10111011011000111 (hexadecimal 176C7, octal 273307).
What is the square root of 95943?
About 309.7467.
Is 95943 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95943?
95943 is a semiprime: 3 × 31981, the product of two primes.