The number 13568
13568 is a composite number with 18 divisors. Its prime factorisation is × 53. Divisors (18): 1, 2, 4, 8, 16, 32, 53, 64, 106, 128, 212, 256, 424, 848, 1696, 3392 … 13568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13568 is composite. Its prime factorisation is
- 3
The divisors add up to 27594; without 13568 itself that is 14026, so 13568 is abundant (14026 is more than 13568). Euler's totient φ(13568) = 6656 numbers up to 13568 share no factor with it.
- 4
The digits of 13568 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 19 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13568 = 2^{8} \times 53 \]13568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 27594 |
| Euler totient φ(n) | 6656 |
| Square | 184090624 |
| Cube | 2497741586432 |
| Square root | 116.481758 (= 16√53) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 19 |
| Scientific notation | 1.3568 × |
13568 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and sixty-eight |
| Binary (base 2) | 11010100000000 |
| Octal (base 8) | 32400 |
| Hexadecimal (base 16) | 3500 |
| Base 3 | 200121112 |
| As time | 13568 seconds = 3 h 46 min 8 s |
Is 13568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13568 ÷ 2 = 6784) | 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 (13568 ÷ 4 = 3392) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (13568 ÷ 8 = 1696) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 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 13568 a prime number?
No. 13568 = × 53, so it is divisible by 2.
What are the factors of 13568?
1, 2, 4, 8, 16, 32, 53, 64, 106, 128, 212, 256, 424, 848, 1696, 3392, 6784, 13568.
What is 13568 in binary?
11010100000000 (hexadecimal 3500, octal 32400).
What is the square root of 13568?
About 116.4818, exactly 16√53.
Is 13568 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 13568?
It is a composite number with 18 divisors.