The number 13641
13641 is a composite number with 4 divisors. Its prime factorisation is 3 × 4547. Divisors (4): 1, 3, 4547, 13641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13641: a semiprime: 3 × 4547, the product of two primes.
- 2
13641 is composite. Its prime factorisation is
- 3
The divisors add up to 18192; without 13641 itself that is 4551, so 13641 is deficient (4551 is less than 13641). Euler's totient φ(13641) = 9092 numbers up to 13641 share no factor with it.
- 4
The digits of 13641 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13641 = 3 \times 4547 \]
13641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18192 |
| Euler totient φ(n) | 9092 |
| Square | 186076881 |
| Cube | 2538274733721 |
| Square root | 116.794692 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.3641 × |
13641 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and forty-one |
| Binary (base 2) | 11010101001001 |
| Octal (base 8) | 32511 |
| Hexadecimal (base 16) | 3549 |
| Base 3 | 200201020 |
| As time | 13641 seconds = 3 h 47 min 21 s |
Is 13641 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13641 ÷ 3 = 4547) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13641 a prime number?
No. 13641 = 3 × 4547, so it is divisible by 3.
What are the factors of 13641?
1, 3, 4547, 13641.
What is 13641 in binary?
11010101001001 (hexadecimal 3549, octal 32511).
What is the square root of 13641?
About 116.7947.
Is 13641 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13641?
13641 is a semiprime: 3 × 4547, the product of two primes.