The number 80590
80590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 8059. Divisors (8): 1, 2, 5, 10, 8059, 16118, 40295, 80590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80590 is composite. Its prime factorisation is
- 3
The divisors add up to 145080; without 80590 itself that is 64490, so 80590 is deficient (64490 is less than 80590). Euler's totient φ(80590) = 32232 numbers up to 80590 share no factor with it.
- 4
The digits of 80590 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80590 = 2 \times 5 \times 8059 \]
80590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 145080 |
| Euler totient φ(n) | 32232 |
| Square | 6494748100 |
| Cube | 523411749379000 |
| Square root | 283.883779 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.059 × |
80590 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand five hundred and ninety |
| Binary (base 2) | 10011101011001110 |
| Octal (base 8) | 235316 |
| Hexadecimal (base 16) | 13ACE |
| Base 3 | 11002112211 |
| As time | 80590 seconds = 22 h 23 min 10 s |
Is 80590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80590 ÷ 2 = 40295) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (80590 ÷ 5 = 16118) | 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 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 6) | 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 (80590 ÷ 10 = 8059) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80590 a prime number?
No. 80590 = 2 × 5 × 8059, so it is divisible by 2.
What are the factors of 80590?
1, 2, 5, 10, 8059, 16118, 40295, 80590.
What is 80590 in binary?
10011101011001110 (hexadecimal 13ACE, octal 235316).
What is the square root of 80590?
About 283.8838.
Is 80590 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 80590?
It is a composite number with 8 divisors.