The number 1173
1173 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 23. Divisors (8): 1, 3, 17, 23, 51, 69, 391, 1173.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1173 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1173 is composite. Its prime factorisation is
- 3
The divisors add up to 1728; without 1173 itself that is 555, so 1173 is deficient (555 is less than 1173). Euler's totient φ(1173) = 704 numbers up to 1173 share no factor with it.
- 4
The digits of 1173 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1173 = 3 \times 17 \times 23 \]
1173 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1728 |
| Euler totient φ(n) | 704 |
| Square | 1375929 |
| Cube | 1613964717 |
| Square root | 34.249088 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.173 × |
1173 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and seventy-three |
| Roman numerals | MCLXXIII |
| Binary (base 2) | 10010010101 |
| Octal (base 8) | 2225 |
| Hexadecimal (base 16) | 495 |
| Base 3 | 1121110 |
| As time | 1173 seconds = 19 min 33 s |
Is 1173 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 (1173 ÷ 3 = 391) | 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 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 4) | 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 5) | 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 7) | 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 1173 a prime number?
No. 1173 = 3 × 17 × 23, so it is divisible by 3.
What are the factors of 1173?
1, 3, 17, 23, 51, 69, 391, 1173.
What is 1173 in binary?
10010010101 (hexadecimal 495, octal 2225).
What is the square root of 1173?
About 34.2491.
What is 1173 in Roman numerals?
MCLXXIII.
Is 1173 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1173?
It is a composite number with 8 divisors.