The number 1157
1157 is a composite number with 4 divisors. Its prime factorisation is 13 × 89. Divisors (4): 1, 13, 89, 1157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1157: a semiprime: 13 × 89, the product of two primes.
- 2
1157 is composite. Its prime factorisation is
- 3
The divisors add up to 1260; without 1157 itself that is 103, so 1157 is deficient (103 is less than 1157). Euler's totient φ(1157) = 1056 numbers up to 1157 share no factor with it.
- 4
The digits of 1157 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1157 = 13 \times 89 \]
1157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1260 |
| Euler totient φ(n) | 1056 |
| Square | 1338649 |
| Cube | 1548816893 |
| Square root | 34.014703 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.157 × |
1157 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and fifty-seven |
| Roman numerals | MCLVII |
| Binary (base 2) | 10010000101 |
| Octal (base 8) | 2205 |
| Hexadecimal (base 16) | 485 |
| Base 3 | 1120212 |
| As time | 1157 seconds = 19 min 17 s |
Is 1157 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 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1157 a prime number?
No. 1157 = 13 × 89, so it is divisible by 13.
What are the factors of 1157?
1, 13, 89, 1157.
What is 1157 in binary?
10010000101 (hexadecimal 485, octal 2205).
What is the square root of 1157?
About 34.0147.
What is 1157 in Roman numerals?
MCLVII.
Is 1157 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1157?
1157 is a semiprime: 13 × 89, the product of two primes.