The number 10490
10490 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1049. Divisors (8): 1, 2, 5, 10, 1049, 2098, 5245, 10490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10490 is composite. Its prime factorisation is
- 3
The divisors add up to 18900; without 10490 itself that is 8410, so 10490 is deficient (8410 is less than 10490). Euler's totient φ(10490) = 4192 numbers up to 10490 share no factor with it.
- 4
The digits of 10490 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10490 = 2 \times 5 \times 1049 \]
10490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18900 |
| Euler totient φ(n) | 4192 |
| Square | 110040100 |
| Cube | 1154320649000 |
| Square root | 102.420701 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.049 × |
10490 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and ninety |
| Binary (base 2) | 10100011111010 |
| Octal (base 8) | 24372 |
| Hexadecimal (base 16) | 28FA |
| Base 3 | 112101112 |
| As time | 10490 seconds = 2 h 54 min 50 s |
Is 10490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10490 ÷ 2 = 5245) | 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 (10490 ÷ 5 = 2098) | 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 4) | 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 | Yes (10490 ÷ 10 = 1049) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10490 a prime number?
No. 10490 = 2 × 5 × 1049, so it is divisible by 2.
What are the factors of 10490?
1, 2, 5, 10, 1049, 2098, 5245, 10490.
What is 10490 in binary?
10100011111010 (hexadecimal 28FA, octal 24372).
What is the square root of 10490?
About 102.4207.
Is 10490 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10490?
It is a composite number with 8 divisors.