The number 5071
5071 is a composite number with 4 divisors. Its prime factorisation is 11 × 461. Divisors (4): 1, 11, 461, 5071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5071: a semiprime: 11 × 461, the product of two primes.
- 2
5071 is composite. Its prime factorisation is
- 3
The divisors add up to 5544; without 5071 itself that is 473, so 5071 is deficient (473 is less than 5071). Euler's totient φ(5071) = 4600 numbers up to 5071 share no factor with it.
- 4
The digits of 5071 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5071 = 11 \times 461 \]
5071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5544 |
| Euler totient φ(n) | 4600 |
| Square | 25715041 |
| Cube | 130400972911 |
| Square root | 71.210954 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.071 × |
5071 in other forms
| Form | Value |
|---|---|
| In words | five thousand and seventy-one |
| Binary (base 2) | 1001111001111 |
| Octal (base 8) | 11717 |
| Hexadecimal (base 16) | 13CF |
| Base 3 | 20221211 |
| As time | 5071 seconds = 1 h 24 min 31 s |
Is 5071 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 | Yes (5071 ÷ 11 = 461) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5071 a prime number?
No. 5071 = 11 × 461, so it is divisible by 11.
What are the factors of 5071?
1, 11, 461, 5071.
What is 5071 in binary?
1001111001111 (hexadecimal 13CF, octal 11717).
What is the square root of 5071?
About 71.2110.
Is 5071 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5071?
5071 is a semiprime: 11 × 461, the product of two primes.