The number 15568
15568 is a composite number with 20 divisors. Its prime factorisation is × 7 × 139. Divisors (20): 1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 139, 278, 556, 973, 1112, 1946 … 15568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15568 is composite. Its prime factorisation is
- 3
The divisors add up to 34720; without 15568 itself that is 19152, so 15568 is abundant (19152 is more than 15568). Euler's totient φ(15568) = 6624 numbers up to 15568 share no factor with it.
- 4
The digits of 15568 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15568 = 2^{4} \times 7 \times 139 \]15568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 34720 |
| Euler totient φ(n) | 6624 |
| Square | 242362624 |
| Cube | 3773101330432 |
| Square root | 124.771792 (= 4√973) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5568 × |
15568 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and sixty-eight |
| Binary (base 2) | 11110011010000 |
| Octal (base 8) | 36320 |
| Hexadecimal (base 16) | 3CD0 |
| Base 3 | 210100121 |
| As time | 15568 seconds = 4 h 19 min 28 s |
Is 15568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15568 ÷ 2 = 7784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15568 ÷ 4 = 3892) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15568 ÷ 7 = 2224) | 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 (15568 ÷ 8 = 1946) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15568 a prime number?
No. 15568 = × 7 × 139, so it is divisible by 2.
What are the factors of 15568?
1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 139, 278, 556, 973, 1112, 1946, 2224, 3892, 7784, 15568.
What is 15568 in binary?
11110011010000 (hexadecimal 3CD0, octal 36320).
What is the square root of 15568?
About 124.7718, exactly 4√973.
Is 15568 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 15568?
It is a composite number with 20 divisors.