The number 12605
12605 is a composite number with 4 divisors. Its prime factorisation is 5 × 2521. Divisors (4): 1, 5, 2521, 12605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12605: a semiprime: 5 × 2521, the product of two primes.
- 2
12605 is composite. Its prime factorisation is
- 3
The divisors add up to 15132; without 12605 itself that is 2527, so 12605 is deficient (2527 is less than 12605). Euler's totient φ(12605) = 10080 numbers up to 12605 share no factor with it.
- 4
The digits of 12605 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12605 = 5 \times 2521 \]
12605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15132 |
| Euler totient φ(n) | 10080 |
| Square | 158886025 |
| Cube | 2002758345125 |
| Square root | 112.271991 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2605 × |
12605 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and five |
| Binary (base 2) | 11000100111101 |
| Octal (base 8) | 30475 |
| Hexadecimal (base 16) | 313D |
| Base 3 | 122021212 |
| As time | 12605 seconds = 3 h 30 min 5 s |
Is 12605 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12605 ÷ 5 = 2521) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12605 a prime number?
No. 12605 = 5 × 2521, so it is divisible by 5.
What are the factors of 12605?
1, 5, 2521, 12605.
What is 12605 in binary?
11000100111101 (hexadecimal 313D, octal 30475).
What is the square root of 12605?
About 112.2720.
Is 12605 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12605?
12605 is a semiprime: 5 × 2521, the product of two primes.