The number 81059
81059 is a composite number with 4 divisors. Its prime factorisation is 11 × 7369. Divisors (4): 1, 11, 7369, 81059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81059: a semiprime: 11 × 7369, the product of two primes.
- 2
81059 is composite. Its prime factorisation is
- 3
The divisors add up to 88440; without 81059 itself that is 7381, so 81059 is deficient (7381 is less than 81059). Euler's totient φ(81059) = 73680 numbers up to 81059 share no factor with it.
- 4
The digits of 81059 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81059 = 11 \times 7369 \]
81059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 88440 |
| Euler totient φ(n) | 73680 |
| Square | 6570561481 |
| Cube | 532603143088379 |
| Square root | 284.708623 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 63 |
| Scientific notation | 8.1059 × |
81059 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand and fifty-nine |
| Binary (base 2) | 10011110010100011 |
| Octal (base 8) | 236243 |
| Hexadecimal (base 16) | 13CA3 |
| Base 3 | 11010012012 |
| As time | 81059 seconds = 22 h 30 min 59 s |
Is 81059 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (81059 ÷ 11 = 7369) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81059 a prime number?
No. 81059 = 11 × 7369, so it is divisible by 11.
What are the factors of 81059?
1, 11, 7369, 81059.
What is 81059 in binary?
10011110010100011 (hexadecimal 13CA3, octal 236243).
What is the square root of 81059?
About 284.7086.
Is 81059 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 81059?
81059 is a semiprime: 11 × 7369, the product of two primes.