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