The number 1183
1183 is a composite number with 6 divisors. Its prime factorisation is 7 Ć . Divisors (6): 1, 7, 13, 91, 169, 1183.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1183: a Harshad number: divisible by its digit sum 13.
- 2
1183 is composite. Its prime factorisation is
- 3
The divisors add up to 1464; without 1183 itself that is 281, so 1183 is deficient (281 is less than 1183). Euler's totient Ļ(1183) = 936 numbers up to 1183 share no factor with it.
- 4
The digits of 1183 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1183 = 7 \times 13^{2} \]1183 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 1464 |
| Euler totient Ļ(n) | 936 |
| Square | 1399489 |
| Cube | 1655595487 |
| Square root | 34.394767 (= 13ā7) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 88 |
| Scientific notation | 1.183 Ć |
1183 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and eighty-three |
| Roman numerals | MCLXXXIII |
| Binary (base 2) | 10010011111 |
| Octal (base 8) | 2237 |
| Hexadecimal (base 16) | 49F |
| Base 3 | 1121211 |
| As time | 1183 seconds = 19 min 43 s |
Is 1183 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 (1183 Ć· 7 = 169) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 6) | 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 1183 a prime number?
No. 1183 = 7 Ć , so it is divisible by 7.
What are the factors of 1183?
1, 7, 13, 91, 169, 1183.
What is 1183 in binary?
10010011111 (hexadecimal 49F, octal 2237).
What is the square root of 1183?
About 34.3948, exactly 13ā7.
What is 1183 in Roman numerals?
MCLXXXIII.
Is 1183 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1183?
1183 is a Harshad number: divisible by its digit sum 13.