The number 7051
7051 is a composite number with 4 divisors. Its prime factorisation is 11 × 641. Divisors (4): 1, 11, 641, 7051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7051: a semiprime: 11 × 641, the product of two primes.
- 2
7051 is composite. Its prime factorisation is
- 3
The divisors add up to 7704; without 7051 itself that is 653, so 7051 is deficient (653 is less than 7051). Euler's totient φ(7051) = 6400 numbers up to 7051 share no factor with it.
- 4
The digits of 7051 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7051 = 11 \times 641 \]
7051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7704 |
| Euler totient φ(n) | 6400 |
| Square | 49716601 |
| Cube | 350551753651 |
| Square root | 83.970233 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 57 |
| Scientific notation | 7.051 × |
7051 in other forms
| Form | Value |
|---|---|
| In words | seven thousand and fifty-one |
| Binary (base 2) | 1101110001011 |
| Octal (base 8) | 15613 |
| Hexadecimal (base 16) | 1B8B |
| Base 3 | 100200011 |
| As time | 7051 seconds = 1 h 57 min 31 s |
Is 7051 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 2) | 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 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 (7051 ÷ 11 = 641) | 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 7051 a prime number?
No. 7051 = 11 × 641, so it is divisible by 11.
What are the factors of 7051?
1, 11, 641, 7051.
What is 7051 in binary?
1101110001011 (hexadecimal 1B8B, octal 15613).
What is the square root of 7051?
About 83.9702.
Is 7051 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 7051?
7051 is a semiprime: 11 × 641, the product of two primes.