The number 12751
12751 is a composite number with 4 divisors. Its prime factorisation is 41 × 311. Divisors (4): 1, 41, 311, 12751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12751: a semiprime: 41 × 311, the product of two primes.
- 2
12751 is composite. Its prime factorisation is
- 3
The divisors add up to 13104; without 12751 itself that is 353, so 12751 is deficient (353 is less than 12751). Euler's totient φ(12751) = 12400 numbers up to 12751 share no factor with it.
- 4
The digits of 12751 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 200 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12751 = 41 \times 311 \]
12751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13104 |
| Euler totient φ(n) | 12400 |
| Square | 162588001 |
| Cube | 2073159600751 |
| Square root | 112.920326 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 200 |
| Scientific notation | 1.2751 × |
12751 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand seven hundred and fifty-one |
| Binary (base 2) | 11000111001111 |
| Octal (base 8) | 30717 |
| Hexadecimal (base 16) | 31CF |
| Base 3 | 122111021 |
| As time | 12751 seconds = 3 h 32 min 31 s |
Is 12751 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 4) | 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 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12751 a prime number?
No. 12751 = 41 × 311, so it is divisible by 41.
What are the factors of 12751?
1, 41, 311, 12751.
What is 12751 in binary?
11000111001111 (hexadecimal 31CF, octal 30717).
What is the square root of 12751?
About 112.9203.
Is 12751 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12751?
12751 is a semiprime: 41 × 311, the product of two primes.