The number 80641
80641 is a composite number with 4 divisors. Its prime factorisation is 11 × 7331. Divisors (4): 1, 11, 7331, 80641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80641: a semiprime: 11 × 7331, the product of two primes.
- 2
80641 is composite. Its prime factorisation is
- 3
The divisors add up to 87984; without 80641 itself that is 7343, so 80641 is deficient (7343 is less than 80641). Euler's totient φ(80641) = 73300 numbers up to 80641 share no factor with it.
- 4
The digits of 80641 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80641 = 11 \times 7331 \]
80641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87984 |
| Euler totient φ(n) | 73300 |
| Square | 6502970881 |
| Cube | 524406074814721 |
| Square root | 283.973590 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.0641 × |
80641 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand six hundred and forty-one |
| Binary (base 2) | 10011101100000001 |
| Octal (base 8) | 235401 |
| Hexadecimal (base 16) | 13B01 |
| Base 3 | 11002121201 |
| As time | 80641 seconds = 22 h 24 min 1 s |
Is 80641 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 | Yes (80641 ÷ 11 = 7331) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80641 a prime number?
No. 80641 = 11 × 7331, so it is divisible by 11.
What are the factors of 80641?
1, 11, 7331, 80641.
What is 80641 in binary?
10011101100000001 (hexadecimal 13B01, octal 235401).
What is the square root of 80641?
About 283.9736.
Is 80641 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 80641?
80641 is a semiprime: 11 × 7331, the product of two primes.