The number 12609
12609 is a composite number with 8 divisors. Its prime factorisation is × 467. Divisors (8): 1, 3, 9, 27, 467, 1401, 4203, 12609.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12609 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12609 is composite. Its prime factorisation is
- 3
The divisors add up to 18720; without 12609 itself that is 6111, so 12609 is deficient (6111 is less than 12609). Euler's totient φ(12609) = 8388 numbers up to 12609 share no factor with it.
- 4
The digits of 12609 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12609 = 3^{3} \times 467 \]12609 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18720 |
| Euler totient φ(n) | 8388 |
| Square | 158986881 |
| Cube | 2004665582529 |
| Square root | 112.289804 (= 3√1401) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2609 × |
12609 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and nine |
| Binary (base 2) | 11000101000001 |
| Octal (base 8) | 30501 |
| Hexadecimal (base 16) | 3141 |
| Base 3 | 122022000 |
| As time | 12609 seconds = 3 h 30 min 9 s |
Is 12609 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 (12609 ÷ 3 = 4203) | 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 | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12609 ÷ 9 = 1401) | 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 3) | 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 12609 a prime number?
No. 12609 = × 467, so it is divisible by 3.
What are the factors of 12609?
1, 3, 9, 27, 467, 1401, 4203, 12609.
What is 12609 in binary?
11000101000001 (hexadecimal 3141, octal 30501).
What is the square root of 12609?
About 112.2898, exactly 3√1401.
Is 12609 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12609?
It is a composite number with 8 divisors.