The number 13558
13558 is a composite number with 4 divisors. Its prime factorisation is 2 × 6779. Divisors (4): 1, 2, 6779, 13558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13558: a semiprime: 2 × 6779, the product of two primes.
- 2
13558 is composite. Its prime factorisation is
- 3
The divisors add up to 20340; without 13558 itself that is 6782, so 13558 is deficient (6782 is less than 13558). Euler's totient φ(13558) = 6778 numbers up to 13558 share no factor with it.
- 4
The digits of 13558 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13558 = 2 \times 6779 \]
13558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20340 |
| Euler totient φ(n) | 6778 |
| Square | 183819364 |
| Cube | 2492222937112 |
| Square root | 116.438825 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.3558 × |
13558 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and fifty-eight |
| Binary (base 2) | 11010011110110 |
| Octal (base 8) | 32366 |
| Hexadecimal (base 16) | 34F6 |
| Base 3 | 200121011 |
| As time | 13558 seconds = 3 h 45 min 58 s |
Is 13558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13558 ÷ 2 = 6779) | 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 3) | 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 6) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 13558 a prime number?
No. 13558 = 2 × 6779, so it is divisible by 2.
What are the factors of 13558?
1, 2, 6779, 13558.
What is 13558 in binary?
11010011110110 (hexadecimal 34F6, octal 32366).
What is the square root of 13558?
About 116.4388.
Is 13558 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 13558?
13558 is a semiprime: 2 × 6779, the product of two primes.