The number 4802
4802 is a composite number with 10 divisors. Its prime factorisation is 2 × . Divisors (10): 1, 2, 7, 14, 49, 98, 343, 686, 2401, 4802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4802: a Harshad number: divisible by its digit sum 14.
- 2
4802 is composite. Its prime factorisation is
- 3
The divisors add up to 8403; without 4802 itself that is 3601, so 4802 is deficient (3601 is less than 4802). Euler's totient φ(4802) = 2058 numbers up to 4802 share no factor with it.
- 4
The digits of 4802 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 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4802 = 2 \times 7^{4} \]4802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 8403 |
| Euler totient φ(n) | 2058 |
| Square | 23059204 |
| Cube | 110730297608 |
| Square root | 69.296465 (= 49√2) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 165 |
| Scientific notation | 4.802 × |
4802 in other forms
| Form | Value |
|---|---|
| In words | four thousand eight hundred and two |
| Binary (base 2) | 1001011000010 |
| Octal (base 8) | 11302 |
| Hexadecimal (base 16) | 12C2 |
| Base 3 | 20120212 |
| As time | 4802 seconds = 1 h 20 min 2 s |
Is 4802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4802 ÷ 2 = 2401) | 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 | Yes (4802 ÷ 7 = 686) | 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 5) | 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 | No (remainder 6) | 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 4802 a prime number?
No. 4802 = 2 × , so it is divisible by 2.
What are the factors of 4802?
1, 2, 7, 14, 49, 98, 343, 686, 2401, 4802.
What is 4802 in binary?
1001011000010 (hexadecimal 12C2, octal 11302).
What is the square root of 4802?
About 69.2965, exactly 49√2.
Is 4802 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4802?
4802 is a Harshad number: divisible by its digit sum 14.