The number 12683
12683 is a composite number with 4 divisors. Its prime factorisation is 11 × 1153. Divisors (4): 1, 11, 1153, 12683.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12683: a semiprime: 11 × 1153, the product of two primes.
- 2
12683 is composite. Its prime factorisation is
- 3
The divisors add up to 13848; without 12683 itself that is 1165, so 12683 is deficient (1165 is less than 12683). Euler's totient φ(12683) = 11520 numbers up to 12683 share no factor with it.
- 4
The digits of 12683 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 200 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12683 = 11 \times 1153 \]
12683 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13848 |
| Euler totient φ(n) | 11520 |
| Square | 160858489 |
| Cube | 2040168215987 |
| Square root | 112.618826 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 200 |
| Scientific notation | 1.2683 × |
12683 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and eighty-three |
| Binary (base 2) | 11000110001011 |
| Octal (base 8) | 30613 |
| Hexadecimal (base 16) | 318B |
| Base 3 | 122101202 |
| As time | 12683 seconds = 3 h 31 min 23 s |
Is 12683 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 | No (remainder 2) | 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 5) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12683 ÷ 11 = 1153) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12683 a prime number?
No. 12683 = 11 × 1153, so it is divisible by 11.
What are the factors of 12683?
1, 11, 1153, 12683.
What is 12683 in binary?
11000110001011 (hexadecimal 318B, octal 30613).
What is the square root of 12683?
About 112.6188.
Is 12683 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12683?
12683 is a semiprime: 11 × 1153, the product of two primes.