The number 1138
1138 is a composite number with 4 divisors. Its prime factorisation is 2 × 569. Divisors (4): 1, 2, 569, 1138.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1138: a semiprime: 2 × 569, the product of two primes.
- 2
1138 is composite. Its prime factorisation is
- 3
The divisors add up to 1710; without 1138 itself that is 572, so 1138 is deficient (572 is less than 1138). Euler's totient φ(1138) = 568 numbers up to 1138 share no factor with it.
- 4
The digits of 1138 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
\[ 1138 = 2 \times 569 \]
1138 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1710 |
| Euler totient φ(n) | 568 |
| Square | 1295044 |
| Cube | 1473760072 |
| Square root | 33.734256 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.138 × |
1138 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and thirty-eight |
| Roman numerals | MCXXXVIII |
| Binary (base 2) | 10001110010 |
| Octal (base 8) | 2162 |
| Hexadecimal (base 16) | 472 |
| Base 3 | 1120011 |
| As time | 1138 seconds = 18 min 58 s |
Is 1138 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1138 ÷ 2 = 569) | 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 | No (remainder 3) | 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 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 2) | 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 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1138 a prime number?
No. 1138 = 2 × 569, so it is divisible by 2.
What are the factors of 1138?
1, 2, 569, 1138.
What is 1138 in binary?
10001110010 (hexadecimal 472, octal 2162).
What is the square root of 1138?
About 33.7343.
What is 1138 in Roman numerals?
MCXXXVIII.
Is 1138 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1138?
1138 is a semiprime: 2 × 569, the product of two primes.