The number 13368
13368 is a composite number with 16 divisors. Its prime factorisation is × 3 × 557. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 557, 1114, 1671, 2228, 3342, 4456, 6684, 13368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13368 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13368 is composite. Its prime factorisation is
- 3
The divisors add up to 33480; without 13368 itself that is 20112, so 13368 is abundant (20112 is more than 13368). Euler's totient φ(13368) = 4448 numbers up to 13368 share no factor with it.
- 4
The digits of 13368 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13368 = 2^{3} \times 3 \times 557 \]13368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 33480 |
| Euler totient φ(n) | 4448 |
| Square | 178703424 |
| Cube | 2388907372032 |
| Square root | 115.620067 (= 2√3342) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3368 × |
13368 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and sixty-eight |
| Binary (base 2) | 11010000111000 |
| Octal (base 8) | 32070 |
| Hexadecimal (base 16) | 3438 |
| Base 3 | 200100010 |
| As time | 13368 seconds = 3 h 42 min 48 s |
Is 13368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13368 ÷ 2 = 6684) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13368 ÷ 3 = 4456) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (13368 ÷ 4 = 3342) | 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 | Yes (13368 ÷ 6 = 2228) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (13368 ÷ 8 = 1671) | 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 | 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 | Yes (13368 ÷ 12 = 1114) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13368 a prime number?
No. 13368 = × 3 × 557, so it is divisible by 2.
What are the factors of 13368?
1, 2, 3, 4, 6, 8, 12, 24, 557, 1114, 1671, 2228, 3342, 4456, 6684, 13368.
What is 13368 in binary?
11010000111000 (hexadecimal 3438, octal 32070).
What is the square root of 13368?
About 115.6201, exactly 2√3342.
Is 13368 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 13368?
It is a composite number with 16 divisors.