The number 15680
15680 is a composite number with 42 divisors. Its prime factorisation is × 5 × . Divisors (42): 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 49, 56 … 15680.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15680: a Harshad number: divisible by its digit sum 20.
- 2
15680 is composite. Its prime factorisation is
- 3
The divisors add up to 43434; without 15680 itself that is 27754, so 15680 is abundant (27754 is more than 15680). Euler's totient φ(15680) = 5376 numbers up to 15680 share no factor with it.
- 4
The digits of 15680 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 27 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15680 = 2^{6} \times 5 \times 7^{2} \]15680 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 42 |
| Sum of divisors | 43434 |
| Euler totient φ(n) | 5376 |
| Square | 245862400 |
| Cube | 3855122432000 |
| Square root | 125.219807 (= 56√5) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 27 |
| Scientific notation | 1.568 × |
15680 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and eighty |
| Binary (base 2) | 11110101000000 |
| Octal (base 8) | 36500 |
| Hexadecimal (base 16) | 3D40 |
| Base 3 | 210111202 |
| As time | 15680 seconds = 4 h 21 min 20 s |
Is 15680 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15680 ÷ 2 = 7840) | 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 | Yes (15680 ÷ 4 = 3920) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15680 ÷ 5 = 3136) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15680 ÷ 7 = 2240) | 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 (15680 ÷ 8 = 1960) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15680 ÷ 10 = 1568) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15680 a prime number?
No. 15680 = × 5 × , so it is divisible by 2.
What are the factors of 15680?
1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 49, 56, 64, 70, 80, 98, 112, 140, 160, 196, 224, 245, 280, 320, 392, 448, 490, 560, 784, 980, 1120, 1568, 1960, 2240, 3136, 3920, 7840, 15680.
What is 15680 in binary?
11110101000000 (hexadecimal 3D40, octal 36500).
What is the square root of 15680?
About 125.2198, exactly 56√5.
Is 15680 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15680?
15680 is a Harshad number: divisible by its digit sum 20.