The number 15609
15609 is a composite number with 12 divisors. Its prime factorisation is 3 × × 43. Divisors (12): 1, 3, 11, 33, 43, 121, 129, 363, 473, 1419, 5203, 15609.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15609 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15609 is composite. Its prime factorisation is
- 3
The divisors add up to 23408; without 15609 itself that is 7799, so 15609 is deficient (7799 is less than 15609). Euler's totient φ(15609) = 9240 numbers up to 15609 share no factor with it.
- 4
The digits of 15609 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15609 = 3 \times 11^{2} \times 43 \]15609 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23408 |
| Euler totient φ(n) | 9240 |
| Square | 243640881 |
| Cube | 3802990511529 |
| Square root | 124.935984 (= 11√129) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5609 × |
15609 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and nine |
| Binary (base 2) | 11110011111001 |
| Octal (base 8) | 36371 |
| Hexadecimal (base 16) | 3CF9 |
| Base 3 | 210102010 |
| As time | 15609 seconds = 4 h 20 min 9 s |
Is 15609 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 (15609 ÷ 3 = 5203) | 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 6) | 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 3) | 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 | Yes (15609 ÷ 11 = 1419) | 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 15609 a prime number?
No. 15609 = 3 × × 43, so it is divisible by 3.
What are the factors of 15609?
1, 3, 11, 33, 43, 121, 129, 363, 473, 1419, 5203, 15609.
What is 15609 in binary?
11110011111001 (hexadecimal 3CF9, octal 36371).
What is the square root of 15609?
About 124.9360, exactly 11√129.
Is 15609 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15609?
It is a composite number with 12 divisors.