The number 71141
71141 is a composite number with 4 divisors. Its prime factorisation is 7 × 10163. Divisors (4): 1, 7, 10163, 71141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 10163, the product of two primes.
- 2
71141 is composite. Its prime factorisation is
- 3
The divisors add up to 81312; without 71141 itself that is 10171, so 71141 is deficient (10171 is less than 71141). Euler's totient φ(71141) = 60972 numbers up to 71141 share no factor with it.
- 4
The digits of 71141 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71141 = 7 \times 10163 \]
71141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81312 |
| Euler totient φ(n) | 60972 |
| Square | 5061041881 |
| Cube | 360047580456221 |
| Square root | 266.722702 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 174 |
| Scientific notation | 7.1141 × |
71141 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand one hundred and forty-one |
| Binary (base 2) | 10001010111100101 |
| Octal (base 8) | 212745 |
| Hexadecimal (base 16) | 115E5 |
| Base 3 | 10121120212 |
| As time | 71141 seconds = 19 h 45 min 41 s |
Is 71141 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 1) | 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 | Yes (71141 ÷ 7 = 10163) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 71141 a prime number?
No. 71141 = 7 × 10163, so it is divisible by 7.
What are the factors of 71141?
1, 7, 10163, 71141.
What is 71141 in binary?
10001010111100101 (hexadecimal 115E5, octal 212745).
What is the square root of 71141?
About 266.7227.
Is 71141 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 71141?
71141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 10163, the product of two primes.