The number 80213
80213 is a composite number with 6 divisors. Its prime factorisation is Ć 1637. Divisors (6): 1, 7, 49, 1637, 11459, 80213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80213 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80213 is composite. Its prime factorisation is
- 3
The divisors add up to 93366; without 80213 itself that is 13153, so 80213 is deficient (13153 is less than 80213). Euler's totient Ļ(80213) = 68712 numbers up to 80213 share no factor with it.
- 4
The digits of 80213 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80213 = 7^{2} \times 1637 \]80213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 93366 |
| Euler totient Ļ(n) | 68712 |
| Square | 6434125369 |
| Cube | 516100498223597 |
| Square root | 283.218997 (= 7ā1637) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.0213 Ć |
80213 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand two hundred and thirteen |
| Binary (base 2) | 10011100101010101 |
| Octal (base 8) | 234525 |
| Hexadecimal (base 16) | 13955 |
| Base 3 | 11002000212 |
| As time | 80213 seconds = 22 h 16 min 53 s |
Is 80213 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 3) | 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 | Yes (80213 Ć· 7 = 11459) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 80213 a prime number?
No. 80213 = Ć 1637, so it is divisible by 7.
What are the factors of 80213?
1, 7, 49, 1637, 11459, 80213.
What is 80213 in binary?
10011100101010101 (hexadecimal 13955, octal 234525).
What is the square root of 80213?
About 283.2190, exactly 7ā1637.
Is 80213 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 80213?
It is a composite number with 6 divisors.