The number 20751
20751 is a composite number with 4 divisors. Its prime factorisation is 3 × 6917. Divisors (4): 1, 3, 6917, 20751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20751: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6917, the product of two primes.
- 2
20751 is composite. Its prime factorisation is
- 3
The divisors add up to 27672; without 20751 itself that is 6921, so 20751 is deficient (6921 is less than 20751). Euler's totient φ(20751) = 13832 numbers up to 20751 share no factor with it.
- 4
The digits of 20751 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20751 = 3 \times 6917 \]
20751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27672 |
| Euler totient φ(n) | 13832 |
| Square | 430604001 |
| Cube | 8935463624751 |
| Square root | 144.052074 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0751 × |
20751 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand seven hundred and fifty-one |
| Binary (base 2) | 101000100001111 |
| Octal (base 8) | 50417 |
| Hexadecimal (base 16) | 510F |
| Base 3 | 1001110120 |
| As time | 20751 seconds = 5 h 45 min 51 s |
Is 20751 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 | Yes (20751 ÷ 3 = 6917) | 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 3) | 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 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20751 a prime number?
No. 20751 = 3 × 6917, so it is divisible by 3.
What are the factors of 20751?
1, 3, 6917, 20751.
What is 20751 in binary?
101000100001111 (hexadecimal 510F, octal 50417).
What is the square root of 20751?
About 144.0521.
Is 20751 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20751?
20751 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6917, the product of two primes.