The number 13161
13161 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 107. Divisors (8): 1, 3, 41, 107, 123, 321, 4387, 13161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13161 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13161 is composite. Its prime factorisation is
- 3
The divisors add up to 18144; without 13161 itself that is 4983, so 13161 is deficient (4983 is less than 13161). Euler's totient φ(13161) = 8480 numbers up to 13161 share no factor with it.
- 4
The digits of 13161 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 200 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13161 = 3 \times 41 \times 107 \]
13161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18144 |
| Euler totient φ(n) | 8480 |
| Square | 173211921 |
| Cube | 2279642092281 |
| Square root | 114.721402 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 200 |
| Scientific notation | 1.3161 × |
13161 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and sixty-one |
| Binary (base 2) | 11001101101001 |
| Octal (base 8) | 31551 |
| Hexadecimal (base 16) | 3369 |
| Base 3 | 200001110 |
| As time | 13161 seconds = 3 h 39 min 21 s |
Is 13161 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 (13161 ÷ 3 = 4387) | 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 | 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 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 5) | 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 13161 a prime number?
No. 13161 = 3 × 41 × 107, so it is divisible by 3.
What are the factors of 13161?
1, 3, 41, 107, 123, 321, 4387, 13161.
What is 13161 in binary?
11001101101001 (hexadecimal 3369, octal 31551).
What is the square root of 13161?
About 114.7214.
Is 13161 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 13161?
It is a composite number with 8 divisors.