The number 83141
83141 is a composite number with 4 divisors. Its prime factorisation is 71 × 1171. Divisors (4): 1, 71, 1171, 83141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 1171, the product of two primes.
- 2
83141 is composite. Its prime factorisation is
- 3
The divisors add up to 84384; without 83141 itself that is 1243, so 83141 is deficient (1243 is less than 83141). Euler's totient φ(83141) = 81900 numbers up to 83141 share no factor with it.
- 4
The digits of 83141 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83141 = 71 \times 1171 \]
83141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84384 |
| Euler totient φ(n) | 81900 |
| Square | 6912425881 |
| Cube | 574706000172221 |
| Square root | 288.341811 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.3141 × |
83141 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand one hundred and forty-one |
| Binary (base 2) | 10100010011000101 |
| Octal (base 8) | 242305 |
| Hexadecimal (base 16) | 144C5 |
| Base 3 | 11020001022 |
| As time | 83141 seconds = 23 h 5 min 41 s |
Is 83141 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 2) | 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 8) | 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 3) | 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 83141 a prime number?
No. 83141 = 71 × 1171, so it is divisible by 71.
What are the factors of 83141?
1, 71, 1171, 83141.
What is 83141 in binary?
10100010011000101 (hexadecimal 144C5, octal 242305).
What is the square root of 83141?
About 288.3418.
Is 83141 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 83141?
83141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 1171, the product of two primes.