The number 11361
11361 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 541. Divisors (8): 1, 3, 7, 21, 541, 1623, 3787, 11361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11361 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11361 is composite. Its prime factorisation is
- 3
The divisors add up to 17344; without 11361 itself that is 5983, so 11361 is deficient (5983 is less than 11361). Euler's totient φ(11361) = 6480 numbers up to 11361 share no factor with it.
- 4
The digits of 11361 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11361 = 3 \times 7 \times 541 \]
11361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17344 |
| Euler totient φ(n) | 6480 |
| Square | 129072321 |
| Cube | 1466390638881 |
| Square root | 106.587992 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1361 × |
11361 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and sixty-one |
| Binary (base 2) | 10110001100001 |
| Octal (base 8) | 26141 |
| Hexadecimal (base 16) | 2C61 |
| Base 3 | 120120210 |
| As time | 11361 seconds = 3 h 9 min 21 s |
Is 11361 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11361 ÷ 3 = 3787) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11361 ÷ 7 = 1623) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11361 a prime number?
No. 11361 = 3 × 7 × 541, so it is divisible by 3.
What are the factors of 11361?
1, 3, 7, 21, 541, 1623, 3787, 11361.
What is 11361 in binary?
10110001100001 (hexadecimal 2C61, octal 26141).
What is the square root of 11361?
About 106.5880.
Is 11361 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11361?
It is a composite number with 8 divisors.