The number 12646
12646 is a composite number with 4 divisors. Its prime factorisation is 2 × 6323. Divisors (4): 1, 2, 6323, 12646.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12646: a semiprime: 2 × 6323, the product of two primes.
- 2
12646 is composite. Its prime factorisation is
- 3
The divisors add up to 18972; without 12646 itself that is 6326, so 12646 is deficient (6326 is less than 12646). Euler's totient φ(12646) = 6322 numbers up to 12646 share no factor with it.
- 4
The digits of 12646 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12646 = 2 \times 6323 \]
12646 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18972 |
| Euler totient φ(n) | 6322 |
| Square | 159921316 |
| Cube | 2022364962136 |
| Square root | 112.454435 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2646 × |
12646 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and forty-six |
| Binary (base 2) | 11000101100110 |
| Octal (base 8) | 30546 |
| Hexadecimal (base 16) | 3166 |
| Base 3 | 122100101 |
| As time | 12646 seconds = 3 h 30 min 46 s |
Is 12646 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12646 ÷ 2 = 6323) | 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 | No (remainder 1) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12646 a prime number?
No. 12646 = 2 × 6323, so it is divisible by 2.
What are the factors of 12646?
1, 2, 6323, 12646.
What is 12646 in binary?
11000101100110 (hexadecimal 3166, octal 30546).
What is the square root of 12646?
About 112.4544.
Is 12646 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 12646?
12646 is a semiprime: 2 × 6323, the product of two primes.