The number 6751
6751 is a composite number with 4 divisors. Its prime factorisation is 43 × 157. Divisors (4): 1, 43, 157, 6751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6751: a semiprime: 43 × 157, the product of two primes.
- 2
6751 is composite. Its prime factorisation is
- 3
The divisors add up to 6952; without 6751 itself that is 201, so 6751 is deficient (201 is less than 6751). Euler's totient φ(6751) = 6552 numbers up to 6751 share no factor with it.
- 4
The digits of 6751 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6751 = 43 \times 157 \]
6751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6952 |
| Euler totient φ(n) | 6552 |
| Square | 45576001 |
| Cube | 307683582751 |
| Square root | 82.164469 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 137 |
| Scientific notation | 6.751 × |
6751 in other forms
| Form | Value |
|---|---|
| In words | six thousand seven hundred and fifty-one |
| Binary (base 2) | 1101001011111 |
| Octal (base 8) | 15137 |
| Hexadecimal (base 16) | 1A5F |
| Base 3 | 100021001 |
| As time | 6751 seconds = 1 h 52 min 31 s |
Is 6751 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 1) | 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 8) | 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 6751 a prime number?
No. 6751 = 43 × 157, so it is divisible by 43.
What are the factors of 6751?
1, 43, 157, 6751.
What is 6751 in binary?
1101001011111 (hexadecimal 1A5F, octal 15137).
What is the square root of 6751?
About 82.1645.
Is 6751 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 6751?
6751 is a semiprime: 43 × 157, the product of two primes.