The number 85141
85141 is a composite number with 4 divisors. Its prime factorisation is 7 × 12163. Divisors (4): 1, 7, 12163, 85141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85141: a semiprime: 7 × 12163, the product of two primes.
- 2
85141 is composite. Its prime factorisation is
- 3
The divisors add up to 97312; without 85141 itself that is 12171, so 85141 is deficient (12171 is less than 85141). Euler's totient φ(85141) = 72972 numbers up to 85141 share no factor with it.
- 4
The digits of 85141 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85141 = 7 \times 12163 \]
85141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97312 |
| Euler totient φ(n) | 72972 |
| Square | 7248989881 |
| Cube | 617186247458221 |
| Square root | 291.789308 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 58 |
| Scientific notation | 8.5141 × |
85141 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand one hundred and forty-one |
| Binary (base 2) | 10100110010010101 |
| Octal (base 8) | 246225 |
| Hexadecimal (base 16) | 14C95 |
| Base 3 | 11022210101 |
| As time | 85141 seconds = 23 h 39 min 1 s |
Is 85141 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 | Yes (85141 ÷ 7 = 12163) | 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 1) | 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 85141 a prime number?
No. 85141 = 7 × 12163, so it is divisible by 7.
What are the factors of 85141?
1, 7, 12163, 85141.
What is 85141 in binary?
10100110010010101 (hexadecimal 14C95, octal 246225).
What is the square root of 85141?
About 291.7893.
Is 85141 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 85141?
85141 is a semiprime: 7 × 12163, the product of two primes.