The number 7141
7141 is a composite number with 4 divisors. Its prime factorisation is 37 × 193. Divisors (4): 1, 37, 193, 7141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7141: a semiprime: 37 × 193, the product of two primes.
- 2
7141 is composite. Its prime factorisation is
- 3
The divisors add up to 7372; without 7141 itself that is 231, so 7141 is deficient (231 is less than 7141). Euler's totient φ(7141) = 6912 numbers up to 7141 share no factor with it.
- 4
The digits of 7141 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7141 = 37 \times 193 \]
7141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7372 |
| Euler totient φ(n) | 6912 |
| Square | 50993881 |
| Cube | 364147304221 |
| Square root | 84.504438 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 31 |
| Scientific notation | 7.141 × |
7141 in other forms
| Form | Value |
|---|---|
| In words | seven thousand one hundred and forty-one |
| Binary (base 2) | 1101111100101 |
| Octal (base 8) | 15745 |
| Hexadecimal (base 16) | 1BE5 |
| Base 3 | 100210111 |
| As time | 7141 seconds = 1 h 59 min 1 s |
Is 7141 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 | No (remainder 1) | 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 4) | 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 2) | 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 7141 a prime number?
No. 7141 = 37 × 193, so it is divisible by 37.
What are the factors of 7141?
1, 37, 193, 7141.
What is 7141 in binary?
1101111100101 (hexadecimal 1BE5, octal 15745).
What is the square root of 7141?
About 84.5044.
Is 7141 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 7141?
7141 is a semiprime: 37 × 193, the product of two primes.