The number 81062
81062 is a composite number with 4 divisors. Its prime factorisation is 2 × 40531. Divisors (4): 1, 2, 40531, 81062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81062: a semiprime: 2 × 40531, the product of two primes.
- 2
81062 is composite. Its prime factorisation is
- 3
The divisors add up to 121596; without 81062 itself that is 40534, so 81062 is deficient (40534 is less than 81062). Euler's totient φ(81062) = 40530 numbers up to 81062 share no factor with it.
- 4
The digits of 81062 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81062 = 2 \times 40531 \]
81062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121596 |
| Euler totient φ(n) | 40530 |
| Square | 6571047844 |
| Cube | 532662280330328 |
| Square root | 284.713891 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 63 |
| Scientific notation | 8.1062 × |
81062 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand and sixty-two |
| Binary (base 2) | 10011110010100110 |
| Octal (base 8) | 236246 |
| Hexadecimal (base 16) | 13CA6 |
| Base 3 | 11010012022 |
| As time | 81062 seconds = 22 h 31 min 2 s |
Is 81062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81062 ÷ 2 = 40531) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81062 a prime number?
No. 81062 = 2 × 40531, so it is divisible by 2.
What are the factors of 81062?
1, 2, 40531, 81062.
What is 81062 in binary?
10011110010100110 (hexadecimal 13CA6, octal 236246).
What is the square root of 81062?
About 284.7139.
Is 81062 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81062?
81062 is a semiprime: 2 × 40531, the product of two primes.