The number 1149
1149 is a composite number with 4 divisors. Its prime factorisation is 3 × 383. Divisors (4): 1, 3, 383, 1149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1149: a semiprime: 3 × 383, the product of two primes.
- 2
1149 is composite. Its prime factorisation is
- 3
The divisors add up to 1536; without 1149 itself that is 387, so 1149 is deficient (387 is less than 1149). Euler's totient φ(1149) = 764 numbers up to 1149 share no factor with it.
- 4
The digits of 1149 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1149 = 3 \times 383 \]
1149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1536 |
| Euler totient φ(n) | 764 |
| Square | 1320201 |
| Cube | 1516910949 |
| Square root | 33.896903 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 44 |
| Scientific notation | 1.149 × |
1149 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and forty-nine |
| Roman numerals | MCXLIX |
| Binary (base 2) | 10001111101 |
| Octal (base 8) | 2175 |
| Hexadecimal (base 16) | 47D |
| Base 3 | 1120120 |
| As time | 1149 seconds = 19 min 9 s |
Is 1149 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 (1149 ÷ 3 = 383) | 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 4) | 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 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 1149 a prime number?
No. 1149 = 3 × 383, so it is divisible by 3.
What are the factors of 1149?
1, 3, 383, 1149.
What is 1149 in binary?
10001111101 (hexadecimal 47D, octal 2175).
What is the square root of 1149?
About 33.8969.
What is 1149 in Roman numerals?
MCXLIX.
Is 1149 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1149?
1149 is a semiprime: 3 × 383, the product of two primes.