The number 80390
80390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 8039. Divisors (8): 1, 2, 5, 10, 8039, 16078, 40195, 80390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80390 is composite. Its prime factorisation is
- 3
The divisors add up to 144720; without 80390 itself that is 64330, so 80390 is deficient (64330 is less than 80390). Euler's totient φ(80390) = 32152 numbers up to 80390 share no factor with it.
- 4
The digits of 80390 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80390 = 2 \times 5 \times 8039 \]
80390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 144720 |
| Euler totient φ(n) | 32152 |
| Square | 6462552100 |
| Cube | 519524563319000 |
| Square root | 283.531303 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.039 × |
80390 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand three hundred and ninety |
| Binary (base 2) | 10011101000000110 |
| Octal (base 8) | 235006 |
| Hexadecimal (base 16) | 13A06 |
| Base 3 | 11002021102 |
| As time | 80390 seconds = 22 h 19 min 50 s |
Is 80390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80390 ÷ 2 = 40195) | 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 (80390 ÷ 5 = 16078) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80390 ÷ 10 = 8039) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 80390 a prime number?
No. 80390 = 2 × 5 × 8039, so it is divisible by 2.
What are the factors of 80390?
1, 2, 5, 10, 8039, 16078, 40195, 80390.
What is 80390 in binary?
10011101000000110 (hexadecimal 13A06, octal 235006).
What is the square root of 80390?
About 283.5313.
Is 80390 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 80390?
It is a composite number with 8 divisors.