The number 80931
80931 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 509. Divisors (8): 1, 3, 53, 159, 509, 1527, 26977, 80931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80931 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80931 is composite. Its prime factorisation is
- 3
The divisors add up to 110160; without 80931 itself that is 29229, so 80931 is deficient (29229 is less than 80931). Euler's totient φ(80931) = 52832 numbers up to 80931 share no factor with it.
- 4
The digits of 80931 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80931 = 3 \times 53 \times 509 \]
80931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 110160 |
| Euler totient φ(n) | 52832 |
| Square | 6549826761 |
| Cube | 530084029594491 |
| Square root | 284.483743 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.0931 × |
80931 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and thirty-one |
| Binary (base 2) | 10011110000100011 |
| Octal (base 8) | 236043 |
| Hexadecimal (base 16) | 13C23 |
| Base 3 | 11010000110 |
| As time | 80931 seconds = 22 h 28 min 51 s |
Is 80931 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 (80931 ÷ 3 = 26977) | 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 4) | 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 3) | 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 4) | 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 80931 a prime number?
No. 80931 = 3 × 53 × 509, so it is divisible by 3.
What are the factors of 80931?
1, 3, 53, 159, 509, 1527, 26977, 80931.
What is 80931 in binary?
10011110000100011 (hexadecimal 13C23, octal 236043).
What is the square root of 80931?
About 284.4837.
Is 80931 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 80931?
It is a composite number with 8 divisors.