The number 95941
95941 is a composite number with 4 divisors. Its prime factorisation is 37 × 2593. Divisors (4): 1, 37, 2593, 95941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95941: a semiprime: 37 × 2593, the product of two primes.
- 2
95941 is composite. Its prime factorisation is
- 3
The divisors add up to 98572; without 95941 itself that is 2631, so 95941 is deficient (2631 is less than 95941). Euler's totient φ(95941) = 93312 numbers up to 95941 share no factor with it.
- 4
The digits of 95941 add up to 28, 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
\[ 95941 = 37 \times 2593 \]
95941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98572 |
| Euler totient φ(n) | 93312 |
| Square | 9204675481 |
| Cube | 883105770322621 |
| Square root | 309.743442 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5941 × |
95941 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and forty-one |
| Binary (base 2) | 10111011011000101 |
| Octal (base 8) | 273305 |
| Hexadecimal (base 16) | 176C5 |
| Base 3 | 11212121101 |
| As time | 95941 seconds = 26 h 39 min 1 s |
Is 95941 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 1) | 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 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 95941 a prime number?
No. 95941 = 37 × 2593, so it is divisible by 37.
What are the factors of 95941?
1, 37, 2593, 95941.
What is 95941 in binary?
10111011011000101 (hexadecimal 176C5, octal 273305).
What is the square root of 95941?
About 309.7434.
Is 95941 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 95941?
95941 is a semiprime: 37 × 2593, the product of two primes.