The number 11683
11683 is a composite number with 4 divisors. Its prime factorisation is 7 × 1669. Divisors (4): 1, 7, 1669, 11683.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11683: a semiprime: 7 × 1669, the product of two primes.
- 2
11683 is composite. Its prime factorisation is
- 3
The divisors add up to 13360; without 11683 itself that is 1677, so 11683 is deficient (1677 is less than 11683). Euler's totient φ(11683) = 10008 numbers up to 11683 share no factor with it.
- 4
The digits of 11683 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11683 = 7 \times 1669 \]
11683 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13360 |
| Euler totient φ(n) | 10008 |
| Square | 136492489 |
| Cube | 1594641748987 |
| Square root | 108.087927 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1683 × |
11683 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and eighty-three |
| Binary (base 2) | 10110110100011 |
| Octal (base 8) | 26643 |
| Hexadecimal (base 16) | 2DA3 |
| Base 3 | 121000201 |
| As time | 11683 seconds = 3 h 14 min 43 s |
Is 11683 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11683 ÷ 7 = 1669) | 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 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11683 a prime number?
No. 11683 = 7 × 1669, so it is divisible by 7.
What are the factors of 11683?
1, 7, 1669, 11683.
What is 11683 in binary?
10110110100011 (hexadecimal 2DA3, octal 26643).
What is the square root of 11683?
About 108.0879.
Is 11683 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11683?
11683 is a semiprime: 7 × 1669, the product of two primes.