The number 81590
81590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 41 × 199. Divisors (16): 1, 2, 5, 10, 41, 82, 199, 205, 398, 410, 995, 1990, 8159, 16318, 40795, 81590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81590 is composite. Its prime factorisation is
- 3
The divisors add up to 151200; without 81590 itself that is 69610, so 81590 is deficient (69610 is less than 81590). Euler's totient φ(81590) = 31680 numbers up to 81590 share no factor with it.
- 4
The digits of 81590 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 213 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81590 = 2 \times 5 \times 41 \times 199 \]
81590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 151200 |
| Euler totient φ(n) | 31680 |
| Square | 6656928100 |
| Cube | 543138763679000 |
| Square root | 285.639633 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.159 × |
81590 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and ninety |
| Binary (base 2) | 10011111010110110 |
| Octal (base 8) | 237266 |
| Hexadecimal (base 16) | 13EB6 |
| Base 3 | 11010220212 |
| As time | 81590 seconds = 22 h 39 min 50 s |
Is 81590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81590 ÷ 2 = 40795) | 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 | Yes (81590 ÷ 5 = 16318) | 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 5) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (81590 ÷ 10 = 8159) | 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 81590 a prime number?
No. 81590 = 2 × 5 × 41 × 199, so it is divisible by 2.
What are the factors of 81590?
1, 2, 5, 10, 41, 82, 199, 205, 398, 410, 995, 1990, 8159, 16318, 40795, 81590.
What is 81590 in binary?
10011111010110110 (hexadecimal 13EB6, octal 237266).
What is the square root of 81590?
About 285.6396.
Is 81590 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 81590?
It is a composite number with 16 divisors.