The number 13106
13106 is a composite number with 4 divisors. Its prime factorisation is 2 × 6553. Divisors (4): 1, 2, 6553, 13106.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13106: a semiprime: 2 × 6553, the product of two primes.
- 2
13106 is composite. Its prime factorisation is
- 3
The divisors add up to 19662; without 13106 itself that is 6556, so 13106 is deficient (6556 is less than 13106). Euler's totient φ(13106) = 6552 numbers up to 13106 share no factor with it.
- 4
The digits of 13106 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13106 = 2 \times 6553 \]
13106 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19662 |
| Euler totient φ(n) | 6552 |
| Square | 171767236 |
| Cube | 2251181395016 |
| Square root | 114.481440 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.3106 × |
13106 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and six |
| Binary (base 2) | 11001100110010 |
| Octal (base 8) | 31462 |
| Hexadecimal (base 16) | 3332 |
| Base 3 | 122222102 |
| As time | 13106 seconds = 3 h 38 min 26 s |
Is 13106 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13106 ÷ 2 = 6553) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13106 a prime number?
No. 13106 = 2 × 6553, so it is divisible by 2.
What are the factors of 13106?
1, 2, 6553, 13106.
What is 13106 in binary?
11001100110010 (hexadecimal 3332, octal 31462).
What is the square root of 13106?
About 114.4814.
Is 13106 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 13106?
13106 is a semiprime: 2 × 6553, the product of two primes.