The number 1172
1172 is a composite number with 6 divisors. Its prime factorisation is × 293. Divisors (6): 1, 2, 4, 293, 586, 1172.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1172 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1172 is composite. Its prime factorisation is
- 3
The divisors add up to 2058; without 1172 itself that is 886, so 1172 is deficient (886 is less than 1172). Euler's totient φ(1172) = 584 numbers up to 1172 share no factor with it.
- 4
The digits of 1172 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1172 = 2^{2} \times 293 \]1172 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2058 |
| Euler totient φ(n) | 584 |
| Square | 1373584 |
| Cube | 1609840448 |
| Square root | 34.234486 (= 2√293) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 119 |
| Scientific notation | 1.172 × |
1172 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and seventy-two |
| Roman numerals | MCLXXII |
| Binary (base 2) | 10010010100 |
| Octal (base 8) | 2224 |
| Hexadecimal (base 16) | 494 |
| Base 3 | 1121102 |
| As time | 1172 seconds = 19 min 32 s |
Is 1172 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1172 ÷ 2 = 586) | 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 | Yes (1172 ÷ 4 = 293) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | 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 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1172 a prime number?
No. 1172 = × 293, so it is divisible by 2.
What are the factors of 1172?
1, 2, 4, 293, 586, 1172.
What is 1172 in binary?
10010010100 (hexadecimal 494, octal 2224).
What is the square root of 1172?
About 34.2345, exactly 2√293.
What is 1172 in Roman numerals?
MCLXXII.
Is 1172 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1172?
It is a composite number with 6 divisors.