The number 1139
1139 is a composite number with 4 divisors. Its prime factorisation is 17 × 67. Divisors (4): 1, 17, 67, 1139.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1139: a semiprime: 17 × 67, the product of two primes.
- 2
1139 is composite. Its prime factorisation is
- 3
The divisors add up to 1224; without 1139 itself that is 85, so 1139 is deficient (85 is less than 1139). Euler's totient φ(1139) = 1056 numbers up to 1139 share no factor with it.
- 4
The digits of 1139 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1139 = 17 \times 67 \]
1139 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1224 |
| Euler totient φ(n) | 1056 |
| Square | 1297321 |
| Cube | 1477648619 |
| Square root | 33.749074 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.139 × |
1139 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and thirty-nine |
| Roman numerals | MCXXXIX |
| Binary (base 2) | 10001110011 |
| Octal (base 8) | 2163 |
| Hexadecimal (base 16) | 473 |
| Base 3 | 1120012 |
| As time | 1139 seconds = 18 min 59 s |
Is 1139 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1139 a prime number?
No. 1139 = 17 × 67, so it is divisible by 17.
What are the factors of 1139?
1, 17, 67, 1139.
What is 1139 in binary?
10001110011 (hexadecimal 473, octal 2163).
What is the square root of 1139?
About 33.7491.
What is 1139 in Roman numerals?
MCXXXIX.
Is 1139 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1139?
1139 is a semiprime: 17 × 67, the product of two primes.