The number 81593
81593 is a composite number with 4 divisors. Its prime factorisation is 139 × 587. Divisors (4): 1, 139, 587, 81593.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81593: a semiprime: 139 × 587, the product of two primes.
- 2
81593 is composite. Its prime factorisation is
- 3
The divisors add up to 82320; without 81593 itself that is 727, so 81593 is deficient (727 is less than 81593). Euler's totient φ(81593) = 80868 numbers up to 81593 share no factor with it.
- 4
The digits of 81593 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81593 = 139 \times 587 \]
81593 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82320 |
| Euler totient φ(n) | 80868 |
| Square | 6657417649 |
| Cube | 543198678234857 |
| Square root | 285.644884 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.1593 × |
81593 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and ninety-three |
| Binary (base 2) | 10011111010111001 |
| Octal (base 8) | 237271 |
| Hexadecimal (base 16) | 13EB9 |
| Base 3 | 11010220222 |
| As time | 81593 seconds = 22 h 39 min 53 s |
Is 81593 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 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 81593 a prime number?
No. 81593 = 139 × 587, so it is divisible by 139.
What are the factors of 81593?
1, 139, 587, 81593.
What is 81593 in binary?
10011111010111001 (hexadecimal 13EB9, octal 237271).
What is the square root of 81593?
About 285.6449.
Is 81593 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 81593?
81593 is a semiprime: 139 × 587, the product of two primes.