The number 71051
71051 is a composite number with 4 divisors. Its prime factorisation is 227 × 313. Divisors (4): 1, 227, 313, 71051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 71051: a semiprime: 227 × 313, the product of two primes.
- 2
71051 is composite. Its prime factorisation is
- 3
The divisors add up to 71592; without 71051 itself that is 541, so 71051 is deficient (541 is less than 71051). Euler's totient φ(71051) = 70512 numbers up to 71051 share no factor with it.
- 4
The digits of 71051 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
\[ 71051 = 227 \times 313 \]
71051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71592 |
| Euler totient φ(n) | 70512 |
| Square | 5048244601 |
| Cube | 358682827145651 |
| Square root | 266.553935 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 174 |
| Scientific notation | 7.1051 × |
71051 in other forms
| Form | Value |
|---|---|
| In words | seventy-one thousand and fifty-one |
| Binary (base 2) | 10001010110001011 |
| Octal (base 8) | 212613 |
| Hexadecimal (base 16) | 1158B |
| Base 3 | 10121110112 |
| As time | 71051 seconds = 19 h 44 min 11 s |
Is 71051 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 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 | 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 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 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 71051 a prime number?
No. 71051 = 227 × 313, so it is divisible by 227.
What are the factors of 71051?
1, 227, 313, 71051.
What is 71051 in binary?
10001010110001011 (hexadecimal 1158B, octal 212613).
What is the square root of 71051?
About 266.5539.
Is 71051 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 71051?
71051 is a semiprime: 227 × 313, the product of two primes.