The number 1150
1150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 23. Divisors (12): 1, 2, 5, 10, 23, 25, 46, 50, 115, 230, 575, 1150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1150 is composite. Its prime factorisation is
- 3
The divisors add up to 2232; without 1150 itself that is 1082, so 1150 is deficient (1082 is less than 1150). Euler's totient φ(1150) = 440 numbers up to 1150 share no factor with it.
- 4
The digits of 1150 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1150 = 2 \times 5^{2} \times 23 \]1150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2232 |
| Euler totient φ(n) | 440 |
| Square | 1322500 |
| Cube | 1520875000 |
| Square root | 33.911650 (= 5√46) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 44 |
| Scientific notation | 1.15 × |
1150 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and fifty |
| Roman numerals | MCL |
| Binary (base 2) | 10001111110 |
| Octal (base 8) | 2176 |
| Hexadecimal (base 16) | 47E |
| Base 3 | 1120121 |
| As time | 1150 seconds = 19 min 10 s |
Is 1150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1150 ÷ 2 = 575) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1150 ÷ 5 = 230) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1150 ÷ 10 = 115) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1150 a prime number?
No. 1150 = 2 × × 23, so it is divisible by 2.
What are the factors of 1150?
1, 2, 5, 10, 23, 25, 46, 50, 115, 230, 575, 1150.
What is 1150 in binary?
10001111110 (hexadecimal 47E, octal 2176).
What is the square root of 1150?
About 33.9116, exactly 5√46.
What is 1150 in Roman numerals?
MCL.
Is 1150 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 1150?
It is a composite number with 12 divisors.