The number 11492
11492 is a composite number with 18 divisors. Its prime factorisation is × × 17. Divisors (18): 1, 2, 4, 13, 17, 26, 34, 52, 68, 169, 221, 338, 442, 676, 884, 2873 … 11492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11492: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
11492 is composite. Its prime factorisation is
- 3
The divisors add up to 23058; without 11492 itself that is 11566, so 11492 is abundant (11566 is more than 11492). Euler's totient φ(11492) = 4992 numbers up to 11492 share no factor with it.
- 4
The digits of 11492 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11492 = 2^{2} \times 13^{2} \times 17 \]11492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 23058 |
| Euler totient φ(n) | 4992 |
| Square | 132066064 |
| Cube | 1517703207488 |
| Square root | 107.200746 (= 26√17) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.1492 × |
11492 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and ninety-two |
| Binary (base 2) | 10110011100100 |
| Octal (base 8) | 26344 |
| Hexadecimal (base 16) | 2CE4 |
| Base 3 | 120202122 |
| As time | 11492 seconds = 3 h 11 min 32 s |
Is 11492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11492 ÷ 2 = 5746) | 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 (11492 ÷ 4 = 2873) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 11492 a prime number?
No. 11492 = × × 17, so it is divisible by 2.
What are the factors of 11492?
1, 2, 4, 13, 17, 26, 34, 52, 68, 169, 221, 338, 442, 676, 884, 2873, 5746, 11492.
What is 11492 in binary?
10110011100100 (hexadecimal 2CE4, octal 26344).
What is the square root of 11492?
About 107.2007, exactly 26√17.
Is 11492 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11492?
11492 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.