The number 12490
12490 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1249. Divisors (8): 1, 2, 5, 10, 1249, 2498, 6245, 12490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12490 is composite. Its prime factorisation is
- 3
The divisors add up to 22500; without 12490 itself that is 10010, so 12490 is deficient (10010 is less than 12490). Euler's totient φ(12490) = 4992 numbers up to 12490 share no factor with it.
- 4
The digits of 12490 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12490 = 2 \times 5 \times 1249 \]
12490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22500 |
| Euler totient φ(n) | 4992 |
| Square | 156000100 |
| Cube | 1948441249000 |
| Square root | 111.758669 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.249 × |
12490 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and ninety |
| Binary (base 2) | 11000011001010 |
| Octal (base 8) | 30312 |
| Hexadecimal (base 16) | 30CA |
| Base 3 | 122010121 |
| As time | 12490 seconds = 3 h 28 min 10 s |
Is 12490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12490 ÷ 2 = 6245) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (12490 ÷ 5 = 2498) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12490 ÷ 10 = 1249) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12490 a prime number?
No. 12490 = 2 × 5 × 1249, so it is divisible by 2.
What are the factors of 12490?
1, 2, 5, 10, 1249, 2498, 6245, 12490.
What is 12490 in binary?
11000011001010 (hexadecimal 30CA, octal 30312).
What is the square root of 12490?
About 111.7587.
Is 12490 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12490?
It is a composite number with 8 divisors.