The number 80690
80690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 8069. Divisors (8): 1, 2, 5, 10, 8069, 16138, 40345, 80690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80690 is composite. Its prime factorisation is
- 3
The divisors add up to 145260; without 80690 itself that is 64570, so 80690 is deficient (64570 is less than 80690). Euler's totient φ(80690) = 32272 numbers up to 80690 share no factor with it.
- 4
The digits of 80690 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
\[ 80690 = 2 \times 5 \times 8069 \]
80690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 145260 |
| Euler totient φ(n) | 32272 |
| Square | 6510876100 |
| Cube | 525362592509000 |
| Square root | 284.059853 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.069 × |
80690 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand six hundred and ninety |
| Binary (base 2) | 10011101100110010 |
| Octal (base 8) | 235462 |
| Hexadecimal (base 16) | 13B32 |
| Base 3 | 11002200112 |
| As time | 80690 seconds = 22 h 24 min 50 s |
Is 80690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80690 ÷ 2 = 40345) | 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 (80690 ÷ 5 = 16138) | 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 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 2) | 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 (80690 ÷ 10 = 8069) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 80690 a prime number?
No. 80690 = 2 × 5 × 8069, so it is divisible by 2.
What are the factors of 80690?
1, 2, 5, 10, 8069, 16138, 40345, 80690.
What is 80690 in binary?
10011101100110010 (hexadecimal 13B32, octal 235462).
What is the square root of 80690?
About 284.0599.
Is 80690 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 80690?
It is a composite number with 8 divisors.