The number 12705
12705 is a composite number with 24 divisors. Its prime factorisation is 3 × 5 × 7 × . Divisors (24): 1, 3, 5, 7, 11, 15, 21, 33, 35, 55, 77, 105, 121, 165, 231, 363 … 12705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12705: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
12705 is composite. Its prime factorisation is
- 3
The divisors add up to 25536; without 12705 itself that is 12831, so 12705 is abundant (12831 is more than 12705). Euler's totient φ(12705) = 5280 numbers up to 12705 share no factor with it.
- 4
The digits of 12705 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 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12705 = 3 \times 5 \times 7 \times 11^{2} \]12705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 25536 |
| Euler totient φ(n) | 5280 |
| Square | 161417025 |
| Cube | 2050803302625 |
| Square root | 112.716458 (= 11√105) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.2705 × |
12705 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand seven hundred and five |
| Binary (base 2) | 11000110100001 |
| Octal (base 8) | 30641 |
| Hexadecimal (base 16) | 31A1 |
| Base 3 | 122102120 |
| As time | 12705 seconds = 3 h 31 min 45 s |
Is 12705 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 (12705 ÷ 3 = 4235) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12705 ÷ 5 = 2541) | 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 | Yes (12705 ÷ 7 = 1815) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12705 ÷ 11 = 1155) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12705 a prime number?
No. 12705 = 3 × 5 × 7 × , so it is divisible by 3.
What are the factors of 12705?
1, 3, 5, 7, 11, 15, 21, 33, 35, 55, 77, 105, 121, 165, 231, 363, 385, 605, 847, 1155, 1815, 2541, 4235, 12705.
What is 12705 in binary?
11000110100001 (hexadecimal 31A1, octal 30641).
What is the square root of 12705?
About 112.7165, exactly 11√105.
Is 12705 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12705?
12705 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.