The number 71057
71057 is a composite number with 4 divisors. Its prime factorisation is 7 × 10151. Divisors (4): 1, 7, 10151, 71057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71057: a semiprime: 7 × 10151, the product of two primes.
- 2
71057 is composite. Its prime factorisation is
- 3
The divisors add up to 81216; without 71057 itself that is 10159, so 71057 is deficient (10159 is less than 71057). Euler's totient φ(71057) = 60900 numbers up to 71057 share no factor with it.
- 4
The digits of 71057 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 71057 = 7 \times 10151 \]
71057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81216 |
| Euler totient φ(n) | 60900 |
| Square | 5049097249 |
| Cube | 358773703222193 |
| Square root | 266.565189 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 99 |
| Scientific notation | 7.1057 × |
71057 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand and fifty-seven |
| Binary (base 2) | 10001010110010001 |
| Octal (base 8) | 212621 |
| Hexadecimal (base 16) | 11591 |
| Base 3 | 10121110202 |
| As time | 71057 seconds = 19 h 44 min 17 s |
Is 71057 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 2) | 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 (71057 ÷ 7 = 10151) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71057 a prime number?
No. 71057 = 7 × 10151, so it is divisible by 7.
What are the factors of 71057?
1, 7, 10151, 71057.
What is 71057 in binary?
10001010110010001 (hexadecimal 11591, octal 212621).
What is the square root of 71057?
About 266.5652.
Is 71057 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 71057?
71057 is a semiprime: 7 × 10151, the product of two primes.