The number 11368
11368 is a composite number with 24 divisors. Its prime factorisation is × × 29. Divisors (24): 1, 2, 4, 7, 8, 14, 28, 29, 49, 56, 58, 98, 116, 196, 203, 232 … 11368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11368 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11368 is composite. Its prime factorisation is
- 3
The divisors add up to 25650; without 11368 itself that is 14282, so 11368 is abundant (14282 is more than 11368). Euler's totient φ(11368) = 4704 numbers up to 11368 share no factor with it.
- 4
The digits of 11368 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11368 = 2^{3} \times 7^{2} \times 29 \]11368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 25650 |
| Euler totient φ(n) | 4704 |
| Square | 129231424 |
| Cube | 1469102828032 |
| Square root | 106.620823 (= 14√58) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.1368 × |
11368 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and sixty-eight |
| Binary (base 2) | 10110001101000 |
| Octal (base 8) | 26150 |
| Hexadecimal (base 16) | 2C68 |
| Base 3 | 120121001 |
| As time | 11368 seconds = 3 h 9 min 28 s |
Is 11368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11368 ÷ 2 = 5684) | 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 (11368 ÷ 4 = 2842) | 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 (11368 ÷ 7 = 1624) | 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 (11368 ÷ 8 = 1421) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11368 a prime number?
No. 11368 = × × 29, so it is divisible by 2.
What are the factors of 11368?
1, 2, 4, 7, 8, 14, 28, 29, 49, 56, 58, 98, 116, 196, 203, 232, 392, 406, 812, 1421, 1624, 2842, 5684, 11368.
What is 11368 in binary?
10110001101000 (hexadecimal 2C68, octal 26150).
What is the square root of 11368?
About 106.6208, exactly 14√58.
Is 11368 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11368?
It is a composite number with 24 divisors.