The number 12290
12290 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1229. Divisors (8): 1, 2, 5, 10, 1229, 2458, 6145, 12290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12290 is composite. Its prime factorisation is
- 3
The divisors add up to 22140; without 12290 itself that is 9850, so 12290 is deficient (9850 is less than 12290). Euler's totient φ(12290) = 4912 numbers up to 12290 share no factor with it.
- 4
The digits of 12290 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12290 = 2 \times 5 \times 1229 \]
12290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22140 |
| Euler totient φ(n) | 4912 |
| Square | 151044100 |
| Cube | 1856331989000 |
| Square root | 110.860272 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.229 × |
12290 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand two hundred and ninety |
| Binary (base 2) | 11000000000010 |
| Octal (base 8) | 30002 |
| Hexadecimal (base 16) | 3002 |
| Base 3 | 121212012 |
| As time | 12290 seconds = 3 h 24 min 50 s |
Is 12290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12290 ÷ 2 = 6145) | 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 (12290 ÷ 5 = 2458) | 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 5) | 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 (12290 ÷ 10 = 1229) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 12290 a prime number?
No. 12290 = 2 × 5 × 1229, so it is divisible by 2.
What are the factors of 12290?
1, 2, 5, 10, 1229, 2458, 6145, 12290.
What is 12290 in binary?
11000000000010 (hexadecimal 3002, octal 30002).
What is the square root of 12290?
About 110.8603.
Is 12290 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12290?
It is a composite number with 8 divisors.