The number 4910
4910 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 491. Divisors (8): 1, 2, 5, 10, 491, 982, 2455, 4910.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4910 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4910 is composite. Its prime factorisation is
- 3
The divisors add up to 8856; without 4910 itself that is 3946, so 4910 is deficient (3946 is less than 4910). Euler's totient φ(4910) = 1960 numbers up to 4910 share no factor with it.
- 4
The digits of 4910 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 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4910 = 2 \times 5 \times 491 \]
4910 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8856 |
| Euler totient φ(n) | 1960 |
| Square | 24108100 |
| Cube | 118370771000 |
| Square root | 70.071392 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.91 × |
4910 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and ten |
| Binary (base 2) | 1001100101110 |
| Octal (base 8) | 11456 |
| Hexadecimal (base 16) | 132E |
| Base 3 | 20201212 |
| As time | 4910 seconds = 1 h 21 min 50 s |
Is 4910 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4910 ÷ 2 = 2455) | 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 | Yes (4910 ÷ 5 = 982) | 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 3) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (4910 ÷ 10 = 491) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 4910 a prime number?
No. 4910 = 2 × 5 × 491, so it is divisible by 2.
What are the factors of 4910?
1, 2, 5, 10, 491, 982, 2455, 4910.
What is 4910 in binary?
1001100101110 (hexadecimal 132E, octal 11456).
What is the square root of 4910?
About 70.0714.
Is 4910 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4910?
It is a composite number with 8 divisors.