The number 95141
95141 is a composite number with 4 divisors. Its prime factorisation is 89 × 1069. Divisors (4): 1, 89, 1069, 95141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95141: a semiprime: 89 × 1069, the product of two primes.
- 2
95141 is composite. Its prime factorisation is
- 3
The divisors add up to 96300; without 95141 itself that is 1159, so 95141 is deficient (1159 is less than 95141). Euler's totient φ(95141) = 93984 numbers up to 95141 share no factor with it.
- 4
The digits of 95141 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 221 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95141 = 89 \times 1069 \]
95141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96300 |
| Euler totient φ(n) | 93984 |
| Square | 9051809881 |
| Cube | 861198243888221 |
| Square root | 308.449348 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 221 |
| Scientific notation | 9.5141 × |
95141 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand one hundred and forty-one |
| Binary (base 2) | 10111001110100101 |
| Octal (base 8) | 271645 |
| Hexadecimal (base 16) | 173A5 |
| Base 3 | 11211111202 |
| As time | 95141 seconds = 26 h 25 min 41 s |
Is 95141 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 1) | 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 4) | 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 2) | 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 2) | 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 95141 a prime number?
No. 95141 = 89 × 1069, so it is divisible by 89.
What are the factors of 95141?
1, 89, 1069, 95141.
What is 95141 in binary?
10111001110100101 (hexadecimal 173A5, octal 271645).
What is the square root of 95141?
About 308.4493.
Is 95141 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 95141?
95141 is a semiprime: 89 × 1069, the product of two primes.