The number 15606
15606 is a composite number with 24 divisors. Its prime factorisation is 2 × × . Divisors (24): 1, 2, 3, 6, 9, 17, 18, 27, 34, 51, 54, 102, 153, 289, 306, 459 … 15606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15606: a Harshad number: divisible by its digit sum 18.
- 2
15606 is composite. Its prime factorisation is
- 3
The divisors add up to 36840; without 15606 itself that is 21234, so 15606 is abundant (21234 is more than 15606). Euler's totient φ(15606) = 4896 numbers up to 15606 share no factor with it.
- 4
The digits of 15606 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15606 = 2 \times 3^{3} \times 17^{2} \]15606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 36840 |
| Euler totient φ(n) | 4896 |
| Square | 243547236 |
| Cube | 3800798165016 |
| Square root | 124.923977 (= 51√6) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5606 × |
15606 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and six |
| Binary (base 2) | 11110011110110 |
| Octal (base 8) | 36366 |
| Hexadecimal (base 16) | 3CF6 |
| Base 3 | 210102000 |
| As time | 15606 seconds = 4 h 20 min 6 s |
Is 15606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15606 ÷ 2 = 7803) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15606 ÷ 3 = 5202) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15606 ÷ 6 = 2601) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15606 ÷ 9 = 1734) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15606 a prime number?
No. 15606 = 2 × × , so it is divisible by 2.
What are the factors of 15606?
1, 2, 3, 6, 9, 17, 18, 27, 34, 51, 54, 102, 153, 289, 306, 459, 578, 867, 918, 1734, 2601, 5202, 7803, 15606.
What is 15606 in binary?
11110011110110 (hexadecimal 3CF6, octal 36366).
What is the square root of 15606?
About 124.9240, exactly 51√6.
Is 15606 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15606?
15606 is a Harshad number: divisible by its digit sum 18.