The number 10802
10802 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 491. Divisors (8): 1, 2, 11, 22, 491, 982, 5401, 10802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10802: a Harshad number: divisible by its digit sum 11.
- 2
10802 is composite. Its prime factorisation is
- 3
The divisors add up to 17712; without 10802 itself that is 6910, so 10802 is deficient (6910 is less than 10802). Euler's totient φ(10802) = 4900 numbers up to 10802 share no factor with it.
- 4
The digits of 10802 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10802 = 2 \times 11 \times 491 \]
10802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17712 |
| Euler totient φ(n) | 4900 |
| Square | 116683204 |
| Cube | 1260411969608 |
| Square root | 103.932671 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.0802 × |
10802 in other forms
| Form | Value |
|---|---|
| In words | ten thousand eight hundred and two |
| Binary (base 2) | 10101000110010 |
| Octal (base 8) | 25062 |
| Hexadecimal (base 16) | 2A32 |
| Base 3 | 112211002 |
| As time | 10802 seconds = 3 h 0 min 2 s |
Is 10802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10802 ÷ 2 = 5401) | 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 2) | 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 2) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (10802 ÷ 11 = 982) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10802 a prime number?
No. 10802 = 2 × 11 × 491, so it is divisible by 2.
What are the factors of 10802?
1, 2, 11, 22, 491, 982, 5401, 10802.
What is 10802 in binary?
10101000110010 (hexadecimal 2A32, octal 25062).
What is the square root of 10802?
About 103.9327.
Is 10802 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10802?
10802 is a Harshad number: divisible by its digit sum 11.