The number 12690
12690 is a composite number with 32 divisors. Its prime factorisation is 2 × × 5 × 47. Divisors (32): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94 … 12690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12690: a Harshad number: divisible by its digit sum 18.
- 2
12690 is composite. Its prime factorisation is
- 3
The divisors add up to 34560; without 12690 itself that is 21870, so 12690 is abundant (21870 is more than 12690). Euler's totient φ(12690) = 3312 numbers up to 12690 share no factor with it.
- 4
The digits of 12690 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12690 = 2 \times 3^{3} \times 5 \times 47 \]12690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 34560 |
| Euler totient φ(n) | 3312 |
| Square | 161036100 |
| Cube | 2043548109000 |
| Square root | 112.649900 (= 3√1410) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.269 × |
12690 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and ninety |
| Binary (base 2) | 11000110010010 |
| Octal (base 8) | 30622 |
| Hexadecimal (base 16) | 3192 |
| Base 3 | 122102000 |
| As time | 12690 seconds = 3 h 31 min 30 s |
Is 12690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12690 ÷ 2 = 6345) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12690 ÷ 3 = 4230) | 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 (12690 ÷ 5 = 2538) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12690 ÷ 6 = 2115) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (12690 ÷ 9 = 1410) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12690 ÷ 10 = 1269) | 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 12690 a prime number?
No. 12690 = 2 × × 5 × 47, so it is divisible by 2.
What are the factors of 12690?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 47, 54, 90, 94, 135, 141, 235, 270, 282, 423, 470, 705, 846, 1269, 1410, 2115, 2538, 4230, 6345, 12690.
What is 12690 in binary?
11000110010010 (hexadecimal 3192, octal 30622).
What is the square root of 12690?
About 112.6499, exactly 3√1410.
Is 12690 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12690?
12690 is a Harshad number: divisible by its digit sum 18.