The number 81341
81341 is a composite number with 4 divisors. Its prime factorisation is 13 × 6257. Divisors (4): 1, 13, 6257, 81341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81341: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6257, the product of two primes.
- 2
81341 is composite. Its prime factorisation is
- 3
The divisors add up to 87612; without 81341 itself that is 6271, so 81341 is deficient (6271 is less than 81341). Euler's totient φ(81341) = 75072 numbers up to 81341 share no factor with it.
- 4
The digits of 81341 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81341 = 13 \times 6257 \]
81341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87612 |
| Euler totient φ(n) | 75072 |
| Square | 6616358281 |
| Cube | 538181198934821 |
| Square root | 285.203436 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.1341 × |
81341 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand three hundred and forty-one |
| Binary (base 2) | 10011110110111101 |
| Octal (base 8) | 236675 |
| Hexadecimal (base 16) | 13DBD |
| Base 3 | 11010120122 |
| As time | 81341 seconds = 22 h 35 min 41 s |
Is 81341 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 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 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 7) | 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 81341 a prime number?
No. 81341 = 13 × 6257, so it is divisible by 13.
What are the factors of 81341?
1, 13, 6257, 81341.
What is 81341 in binary?
10011110110111101 (hexadecimal 13DBD, octal 236675).
What is the square root of 81341?
About 285.2034.
Is 81341 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81341?
81341 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6257, the product of two primes.