The number 80561
80561 is a composite number with 4 divisors. Its prime factorisation is 13 × 6197. Divisors (4): 1, 13, 6197, 80561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80561: a semiprime: 13 × 6197, the product of two primes.
- 2
80561 is composite. Its prime factorisation is
- 3
The divisors add up to 86772; without 80561 itself that is 6211, so 80561 is deficient (6211 is less than 80561). Euler's totient φ(80561) = 74352 numbers up to 80561 share no factor with it.
- 4
The digits of 80561 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80561 = 13 \times 6197 \]
80561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86772 |
| Euler totient φ(n) | 74352 |
| Square | 6490074721 |
| Cube | 522846909598481 |
| Square root | 283.832697 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.0561 × |
80561 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand five hundred and sixty-one |
| Binary (base 2) | 10011101010110001 |
| Octal (base 8) | 235261 |
| Hexadecimal (base 16) | 13AB1 |
| Base 3 | 11002111202 |
| As time | 80561 seconds = 22 h 22 min 41 s |
Is 80561 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80561 a prime number?
No. 80561 = 13 × 6197, so it is divisible by 13.
What are the factors of 80561?
1, 13, 6197, 80561.
What is 80561 in binary?
10011101010110001 (hexadecimal 13AB1, octal 235261).
What is the square root of 80561?
About 283.8327.
Is 80561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 80561?
80561 is a semiprime: 13 × 6197, the product of two primes.