The number 11464
11464 is a composite number with 8 divisors. Its prime factorisation is × 1433. Divisors (8): 1, 2, 4, 8, 1433, 2866, 5732, 11464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11464: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11464 is composite. Its prime factorisation is
- 3
The divisors add up to 21510; without 11464 itself that is 10046, so 11464 is deficient (10046 is less than 11464). Euler's totient φ(11464) = 5728 numbers up to 11464 share no factor with it.
- 4
The digits of 11464 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11464 = 2^{3} \times 1433 \]11464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21510 |
| Euler totient φ(n) | 5728 |
| Square | 131423296 |
| Cube | 1506636665344 |
| Square root | 107.070071 (= 2√2866) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.1464 × |
11464 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty-four |
| Binary (base 2) | 10110011001000 |
| Octal (base 8) | 26310 |
| Hexadecimal (base 16) | 2CC8 |
| Base 3 | 120201121 |
| As time | 11464 seconds = 3 h 11 min 4 s |
Is 11464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11464 ÷ 2 = 5732) | 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 (11464 ÷ 4 = 2866) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | 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 (11464 ÷ 8 = 1433) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 11464 a prime number?
No. 11464 = × 1433, so it is divisible by 2.
What are the factors of 11464?
1, 2, 4, 8, 1433, 2866, 5732, 11464.
What is 11464 in binary?
10110011001000 (hexadecimal 2CC8, octal 26310).
What is the square root of 11464?
About 107.0701, exactly 2√2866.
Is 11464 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11464?
11464 is a happy number: repeatedly adding the squares of its digits reaches 1.