The number 15600
15600 is a composite number with 60 divisors. Its prime factorisation is × 3 × × 13. Divisors (60): 1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 16, 20, 24, 25, 26 … 15600.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15600: a Harshad number: divisible by its digit sum 12.
- 2
15600 is composite. Its prime factorisation is
- 3
The divisors add up to 53816; without 15600 itself that is 38216, so 15600 is abundant (38216 is more than 15600). Euler's totient φ(15600) = 3840 numbers up to 15600 share no factor with it.
- 4
The digits of 15600 add up to 12, 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
\[ 15600 = 2^{4} \times 3 \times 5^{2} \times 13 \]15600 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 53816 |
| Euler totient φ(n) | 3840 |
| Square | 243360000 |
| Cube | 3796416000000 |
| Square root | 124.899960 (= 20√39) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.56 × |
15600 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred |
| Binary (base 2) | 11110011110000 |
| Octal (base 8) | 36360 |
| Hexadecimal (base 16) | 3CF0 |
| Base 3 | 210101210 |
| As time | 15600 seconds = 4 h 20 min 0 s |
Is 15600 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15600 ÷ 2 = 7800) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15600 ÷ 3 = 5200) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15600 ÷ 4 = 3900) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15600 ÷ 5 = 3120) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15600 ÷ 6 = 2600) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (15600 ÷ 8 = 1950) | 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 | Yes (15600 ÷ 10 = 1560) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15600 ÷ 12 = 1300) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15600 a prime number?
No. 15600 = × 3 × × 13, so it is divisible by 2.
What are the factors of 15600?
1, 2, 3, 4, 5, 6, 8, 10, 12, 13, 15, 16, 20, 24, 25, 26, 30, 39, 40, 48, 50, 52, 60, 65, 75, 78, 80, 100, 104, 120, 130, 150, 156, 195, 200, 208, 240, 260, 300, 312, 325, 390, 400, 520, 600, 624, 650, 780, 975, 1040, 1200, 1300, 1560, 1950, 2600, 3120, 3900, 5200, 7800, 15600.
What is 15600 in binary?
11110011110000 (hexadecimal 3CF0, octal 36360).
What is the square root of 15600?
About 124.9000, exactly 20√39.
Is 15600 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15600?
15600 is a Harshad number: divisible by its digit sum 12.