The number 12707
12707 is a composite number with 4 divisors. Its prime factorisation is 97 × 131. Divisors (4): 1, 97, 131, 12707.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12707: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 97 × 131, the product of two primes.
- 2
12707 is composite. Its prime factorisation is
- 3
The divisors add up to 12936; without 12707 itself that is 229, so 12707 is deficient (229 is less than 12707). Euler's totient φ(12707) = 12480 numbers up to 12707 share no factor with it.
- 4
The digits of 12707 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12707 = 97 \times 131 \]
12707 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12936 |
| Euler totient φ(n) | 12480 |
| Square | 161467849 |
| Cube | 2051771957243 |
| Square root | 112.725330 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.2707 × |
12707 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand seven hundred and seven |
| Binary (base 2) | 11000110100011 |
| Octal (base 8) | 30643 |
| Hexadecimal (base 16) | 31A3 |
| Base 3 | 122102122 |
| As time | 12707 seconds = 3 h 31 min 47 s |
Is 12707 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 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12707 a prime number?
No. 12707 = 97 × 131, so it is divisible by 97.
What are the factors of 12707?
1, 97, 131, 12707.
What is 12707 in binary?
11000110100011 (hexadecimal 31A3, octal 30643).
What is the square root of 12707?
About 112.7253.
Is 12707 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12707?
12707 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 97 × 131, the product of two primes.