The number 11362
11362 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 19 × 23. Divisors (16): 1, 2, 13, 19, 23, 26, 38, 46, 247, 299, 437, 494, 598, 874, 5681, 11362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11362: a Harshad number: divisible by its digit sum 13.
- 2
11362 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 11362 itself that is 8798, so 11362 is deficient (8798 is less than 11362). Euler's totient φ(11362) = 4752 numbers up to 11362 share no factor with it.
- 4
The digits of 11362 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11362 = 2 \times 13 \times 19 \times 23 \]
11362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 4752 |
| Square | 129095044 |
| Cube | 1466777889928 |
| Square root | 106.592683 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1362 × |
11362 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and sixty-two |
| Binary (base 2) | 10110001100010 |
| Octal (base 8) | 26142 |
| Hexadecimal (base 16) | 2C62 |
| Base 3 | 120120211 |
| As time | 11362 seconds = 3 h 9 min 22 s |
Is 11362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11362 ÷ 2 = 5681) | 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 | No (remainder 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11362 a prime number?
No. 11362 = 2 × 13 × 19 × 23, so it is divisible by 2.
What are the factors of 11362?
1, 2, 13, 19, 23, 26, 38, 46, 247, 299, 437, 494, 598, 874, 5681, 11362.
What is 11362 in binary?
10110001100010 (hexadecimal 2C62, octal 26142).
What is the square root of 11362?
About 106.5927.
Is 11362 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11362?
11362 is a Harshad number: divisible by its digit sum 13.