The number 81580
81580 is a composite number with 12 divisors. Its prime factorisation is × 5 × 4079. Divisors (12): 1, 2, 4, 5, 10, 20, 4079, 8158, 16316, 20395, 40790, 81580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81580 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81580 is composite. Its prime factorisation is
- 3
The divisors add up to 171360; without 81580 itself that is 89780, so 81580 is abundant (89780 is more than 81580). Euler's totient φ(81580) = 32624 numbers up to 81580 share no factor with it.
- 4
The digits of 81580 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81580 = 2^{2} \times 5 \times 4079 \]81580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 171360 |
| Euler totient φ(n) | 32624 |
| Square | 6655296400 |
| Cube | 542939080312000 |
| Square root | 285.622128 (= 2√20395) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.158 × |
81580 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and eighty |
| Binary (base 2) | 10011111010101100 |
| Octal (base 8) | 237254 |
| Hexadecimal (base 16) | 13EAC |
| Base 3 | 11010220111 |
| As time | 81580 seconds = 22 h 39 min 40 s |
Is 81580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81580 ÷ 2 = 40790) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (81580 ÷ 4 = 20395) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (81580 ÷ 5 = 16316) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (81580 ÷ 10 = 8158) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81580 a prime number?
No. 81580 = × 5 × 4079, so it is divisible by 2.
What are the factors of 81580?
1, 2, 4, 5, 10, 20, 4079, 8158, 16316, 20395, 40790, 81580.
What is 81580 in binary?
10011111010101100 (hexadecimal 13EAC, octal 237254).
What is the square root of 81580?
About 285.6221, exactly 2√20395.
Is 81580 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 81580?
It is a composite number with 12 divisors.