The number 13646
13646 is a composite number with 4 divisors. Its prime factorisation is 2 × 6823. Divisors (4): 1, 2, 6823, 13646.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13646: a semiprime: 2 × 6823, the product of two primes.
- 2
13646 is composite. Its prime factorisation is
- 3
The divisors add up to 20472; without 13646 itself that is 6826, so 13646 is deficient (6826 is less than 13646). Euler's totient φ(13646) = 6822 numbers up to 13646 share no factor with it.
- 4
The digits of 13646 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13646 = 2 \times 6823 \]
13646 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20472 |
| Euler totient φ(n) | 6822 |
| Square | 186213316 |
| Cube | 2541066910136 |
| Square root | 116.816095 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.3646 × |
13646 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and forty-six |
| Binary (base 2) | 11010101001110 |
| Octal (base 8) | 32516 |
| Hexadecimal (base 16) | 354E |
| Base 3 | 200201102 |
| As time | 13646 seconds = 3 h 47 min 26 s |
Is 13646 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13646 ÷ 2 = 6823) | 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 | No (remainder 1) | 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 3) | 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 2) | 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 6) | 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 13646 a prime number?
No. 13646 = 2 × 6823, so it is divisible by 2.
What are the factors of 13646?
1, 2, 6823, 13646.
What is 13646 in binary?
11010101001110 (hexadecimal 354E, octal 32516).
What is the square root of 13646?
About 116.8161.
Is 13646 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 13646?
13646 is a semiprime: 2 × 6823, the product of two primes.