The number 1159
1159 is a composite number with 4 divisors. Its prime factorisation is 19 × 61. Divisors (4): 1, 19, 61, 1159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1159: a semiprime: 19 × 61, the product of two primes.
- 2
1159 is composite. Its prime factorisation is
- 3
The divisors add up to 1240; without 1159 itself that is 81, so 1159 is deficient (81 is less than 1159). Euler's totient φ(1159) = 1080 numbers up to 1159 share no factor with it.
- 4
The digits of 1159 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1159 = 19 \times 61 \]
1159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1240 |
| Euler totient φ(n) | 1080 |
| Square | 1343281 |
| Cube | 1556862679 |
| Square root | 34.044089 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.159 × |
1159 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and fifty-nine |
| Roman numerals | MCLIX |
| Binary (base 2) | 10010000111 |
| Octal (base 8) | 2207 |
| Hexadecimal (base 16) | 487 |
| Base 3 | 1120221 |
| As time | 1159 seconds = 19 min 19 s |
Is 1159 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 4) | 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 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 7) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 1159 a prime number?
No. 1159 = 19 × 61, so it is divisible by 19.
What are the factors of 1159?
1, 19, 61, 1159.
What is 1159 in binary?
10010000111 (hexadecimal 487, octal 2207).
What is the square root of 1159?
About 34.0441.
What is 1159 in Roman numerals?
MCLIX.
Is 1159 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1159?
1159 is a semiprime: 19 × 61, the product of two primes.