The number 1147
1147 is a composite number with 4 divisors. Its prime factorisation is 31 × 37. Divisors (4): 1, 31, 37, 1147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1147: a semiprime: 31 × 37, the product of two primes.
- 2
1147 is composite. Its prime factorisation is
- 3
The divisors add up to 1216; without 1147 itself that is 69, so 1147 is deficient (69 is less than 1147). Euler's totient φ(1147) = 1080 numbers up to 1147 share no factor with it.
- 4
The digits of 1147 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1147 = 31 \times 37 \]
1147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1216 |
| Euler totient φ(n) | 1080 |
| Square | 1315609 |
| Cube | 1509003523 |
| Square root | 33.867388 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.147 × |
1147 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and forty-seven |
| Roman numerals | MCXLVII |
| Binary (base 2) | 10001111011 |
| Octal (base 8) | 2173 |
| Hexadecimal (base 16) | 47B |
| Base 3 | 1120111 |
| As time | 1147 seconds = 19 min 7 s |
Is 1147 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 2) | 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 | No (remainder 6) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 1147 a prime number?
No. 1147 = 31 × 37, so it is divisible by 31.
What are the factors of 1147?
1, 31, 37, 1147.
What is 1147 in binary?
10001111011 (hexadecimal 47B, octal 2173).
What is the square root of 1147?
About 33.8674.
What is 1147 in Roman numerals?
MCXLVII.
Is 1147 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1147?
1147 is a semiprime: 31 × 37, the product of two primes.