The number 12759
12759 is a composite number with 4 divisors. Its prime factorisation is 3 × 4253. Divisors (4): 1, 3, 4253, 12759.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12759: a semiprime: 3 × 4253, the product of two primes.
- 2
12759 is composite. Its prime factorisation is
- 3
The divisors add up to 17016; without 12759 itself that is 4257, so 12759 is deficient (4257 is less than 12759). Euler's totient φ(12759) = 8504 numbers up to 12759 share no factor with it.
- 4
The digits of 12759 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12759 = 3 \times 4253 \]
12759 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17016 |
| Euler totient φ(n) | 8504 |
| Square | 162792081 |
| Cube | 2077064161479 |
| Square root | 112.955744 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.2759 × |
12759 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand seven hundred and fifty-nine |
| Binary (base 2) | 11000111010111 |
| Octal (base 8) | 30727 |
| Hexadecimal (base 16) | 31D7 |
| Base 3 | 122111120 |
| As time | 12759 seconds = 3 h 32 min 39 s |
Is 12759 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 (12759 ÷ 3 = 4253) | 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 4) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 12759 a prime number?
No. 12759 = 3 × 4253, so it is divisible by 3.
What are the factors of 12759?
1, 3, 4253, 12759.
What is 12759 in binary?
11000111010111 (hexadecimal 31D7, octal 30727).
What is the square root of 12759?
About 112.9557.
Is 12759 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 12759?
12759 is a semiprime: 3 × 4253, the product of two primes.