The number 13361
13361 is a composite number with 4 divisors. Its prime factorisation is 31 × 431. Divisors (4): 1, 31, 431, 13361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13361: a semiprime: 31 × 431, the product of two primes.
- 2
13361 is composite. Its prime factorisation is
- 3
The divisors add up to 13824; without 13361 itself that is 463, so 13361 is deficient (463 is less than 13361). Euler's totient φ(13361) = 12900 numbers up to 13361 share no factor with it.
- 4
The digits of 13361 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13361 = 31 \times 431 \]
13361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13824 |
| Euler totient φ(n) | 12900 |
| Square | 178516321 |
| Cube | 2385156564881 |
| Square root | 115.589792 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.3361 × |
13361 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and sixty-one |
| Binary (base 2) | 11010000110001 |
| Octal (base 8) | 32061 |
| Hexadecimal (base 16) | 3431 |
| Base 3 | 200022212 |
| As time | 13361 seconds = 3 h 42 min 41 s |
Is 13361 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 | No (remainder 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13361 a prime number?
No. 13361 = 31 × 431, so it is divisible by 31.
What are the factors of 13361?
1, 31, 431, 13361.
What is 13361 in binary?
11010000110001 (hexadecimal 3431, octal 32061).
What is the square root of 13361?
About 115.5898.
Is 13361 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 13361?
13361 is a semiprime: 31 × 431, the product of two primes.