The number 4902
4902 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 19 × 43. Divisors (16): 1, 2, 3, 6, 19, 38, 43, 57, 86, 114, 129, 258, 817, 1634, 2451, 4902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4902 is composite. Its prime factorisation is
- 3
The divisors add up to 10560; without 4902 itself that is 5658, so 4902 is abundant (5658 is more than 4902). Euler's totient φ(4902) = 1512 numbers up to 4902 share no factor with it.
- 4
The digits of 4902 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4902 = 2 \times 3 \times 19 \times 43 \]
4902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 10560 |
| Euler totient φ(n) | 1512 |
| Square | 24029604 |
| Cube | 117793118808 |
| Square root | 70.014284 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.902 × |
4902 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and two |
| Binary (base 2) | 1001100100110 |
| Octal (base 8) | 11446 |
| Hexadecimal (base 16) | 1326 |
| Base 3 | 20201120 |
| As time | 4902 seconds = 1 h 21 min 42 s |
Is 4902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4902 ÷ 2 = 2451) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4902 ÷ 3 = 1634) | 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 | Yes (4902 ÷ 6 = 817) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4902 a prime number?
No. 4902 = 2 × 3 × 19 × 43, so it is divisible by 2.
What are the factors of 4902?
1, 2, 3, 6, 19, 38, 43, 57, 86, 114, 129, 258, 817, 1634, 2451, 4902.
What is 4902 in binary?
1001100100110 (hexadecimal 1326, octal 11446).
What is the square root of 4902?
About 70.0143.
Is 4902 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 4902?
It is a composite number with 16 divisors.