The number 1141
1141 is a composite number with 4 divisors. Its prime factorisation is 7 × 163. Divisors (4): 1, 7, 163, 1141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1141: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 7; a semiprime: 7 × 163, the product of two primes.
- 2
1141 is composite. Its prime factorisation is
- 3
The divisors add up to 1312; without 1141 itself that is 171, so 1141 is deficient (171 is less than 1141). Euler's totient φ(1141) = 972 numbers up to 1141 share no factor with it.
- 4
The digits of 1141 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1141 = 7 \times 163 \]
1141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1312 |
| Euler totient φ(n) | 972 |
| Square | 1301881 |
| Cube | 1485446221 |
| Square root | 33.778692 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 106 |
| Scientific notation | 1.141 × |
1141 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and forty-one |
| Roman numerals | MCXLI |
| Binary (base 2) | 10001110101 |
| Octal (base 8) | 2165 |
| Hexadecimal (base 16) | 475 |
| Base 3 | 1120021 |
| As time | 1141 seconds = 19 min 1 s |
Is 1141 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (1141 ÷ 7 = 163) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1141 a prime number?
No. 1141 = 7 × 163, so it is divisible by 7.
What are the factors of 1141?
1, 7, 163, 1141.
What is 1141 in binary?
10001110101 (hexadecimal 475, octal 2165).
What is the square root of 1141?
About 33.7787.
What is 1141 in Roman numerals?
MCXLI.
Is 1141 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 1141?
1141 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 7; a semiprime: 7 × 163, the product of two primes.