The number 11468
11468 is a composite number with 12 divisors. Its prime factorisation is × 47 × 61. Divisors (12): 1, 2, 4, 47, 61, 94, 122, 188, 244, 2867, 5734, 11468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11468 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11468 is composite. Its prime factorisation is
- 3
The divisors add up to 20832; without 11468 itself that is 9364, so 11468 is deficient (9364 is less than 11468). Euler's totient φ(11468) = 5520 numbers up to 11468 share no factor with it.
- 4
The digits of 11468 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 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11468 = 2^{2} \times 47 \times 61 \]11468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20832 |
| Euler totient φ(n) | 5520 |
| Square | 131515024 |
| Cube | 1508214295232 |
| Square root | 107.088748 (= 2√2867) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.1468 × |
11468 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty-eight |
| Binary (base 2) | 10110011001100 |
| Octal (base 8) | 26314 |
| Hexadecimal (base 16) | 2CCC |
| Base 3 | 120201202 |
| As time | 11468 seconds = 3 h 11 min 8 s |
Is 11468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11468 ÷ 2 = 5734) | 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 (11468 ÷ 4 = 2867) | 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 | No (remainder 4) | 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 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 11468 a prime number?
No. 11468 = × 47 × 61, so it is divisible by 2.
What are the factors of 11468?
1, 2, 4, 47, 61, 94, 122, 188, 244, 2867, 5734, 11468.
What is 11468 in binary?
10110011001100 (hexadecimal 2CCC, octal 26314).
What is the square root of 11468?
About 107.0887, exactly 2√2867.
Is 11468 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 11468?
It is a composite number with 12 divisors.