The number 80391
80391 is a composite number with 8 divisors. Its prime factorisation is 3 × 127 × 211. Divisors (8): 1, 3, 127, 211, 381, 633, 26797, 80391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80391 is composite. Its prime factorisation is
- 3
The divisors add up to 108544; without 80391 itself that is 28153, so 80391 is deficient (28153 is less than 80391). Euler's totient φ(80391) = 52920 numbers up to 80391 share no factor with it.
- 4
The digits of 80391 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80391 = 3 \times 127 \times 211 \]
80391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108544 |
| Euler totient φ(n) | 52920 |
| Square | 6462712881 |
| Cube | 519543951216471 |
| Square root | 283.533067 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 68 |
| Scientific notation | 8.0391 × |
80391 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand three hundred and ninety-one |
| Binary (base 2) | 10011101000000111 |
| Octal (base 8) | 235007 |
| Hexadecimal (base 16) | 13A07 |
| Base 3 | 11002021110 |
| As time | 80391 seconds = 22 h 19 min 51 s |
Is 80391 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (80391 ÷ 3 = 26797) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80391 a prime number?
No. 80391 = 3 × 127 × 211, so it is divisible by 3.
What are the factors of 80391?
1, 3, 127, 211, 381, 633, 26797, 80391.
What is 80391 in binary?
10011101000000111 (hexadecimal 13A07, octal 235007).
What is the square root of 80391?
About 283.5331.
Is 80391 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 80391?
It is a composite number with 8 divisors.