The number 80947
80947 is a composite number with 4 divisors. Its prime factorisation is 61 × 1327. Divisors (4): 1, 61, 1327, 80947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80947: a semiprime: 61 × 1327, the product of two primes.
- 2
80947 is composite. Its prime factorisation is
- 3
The divisors add up to 82336; without 80947 itself that is 1389, so 80947 is deficient (1389 is less than 80947). Euler's totient φ(80947) = 79560 numbers up to 80947 share no factor with it.
- 4
The digits of 80947 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80947 = 61 \times 1327 \]
80947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82336 |
| Euler totient φ(n) | 79560 |
| Square | 6552416809 |
| Cube | 530398483438123 |
| Square root | 284.511863 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.0947 × |
80947 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and forty-seven |
| Binary (base 2) | 10011110000110011 |
| Octal (base 8) | 236063 |
| Hexadecimal (base 16) | 13C33 |
| Base 3 | 11010001001 |
| As time | 80947 seconds = 22 h 29 min 7 s |
Is 80947 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 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80947 a prime number?
No. 80947 = 61 × 1327, so it is divisible by 61.
What are the factors of 80947?
1, 61, 1327, 80947.
What is 80947 in binary?
10011110000110011 (hexadecimal 13C33, octal 236063).
What is the square root of 80947?
About 284.5119.
Is 80947 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 80947?
80947 is a semiprime: 61 × 1327, the product of two primes.