The number 10558
10558 is a composite number with 4 divisors. Its prime factorisation is 2 × 5279. Divisors (4): 1, 2, 5279, 10558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10558: a semiprime: 2 × 5279, the product of two primes.
- 2
10558 is composite. Its prime factorisation is
- 3
The divisors add up to 15840; without 10558 itself that is 5282, so 10558 is deficient (5282 is less than 10558). Euler's totient φ(10558) = 5278 numbers up to 10558 share no factor with it.
- 4
The digits of 10558 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10558 = 2 \times 5279 \]
10558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15840 |
| Euler totient φ(n) | 5278 |
| Square | 111471364 |
| Cube | 1176914661112 |
| Square root | 102.752129 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 1.0558 × |
10558 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and fifty-eight |
| Binary (base 2) | 10100100111110 |
| Octal (base 8) | 24476 |
| Hexadecimal (base 16) | 293E |
| Base 3 | 112111001 |
| As time | 10558 seconds = 2 h 55 min 58 s |
Is 10558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10558 ÷ 2 = 5279) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 9) | 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 10558 a prime number?
No. 10558 = 2 × 5279, so it is divisible by 2.
What are the factors of 10558?
1, 2, 5279, 10558.
What is 10558 in binary?
10100100111110 (hexadecimal 293E, octal 24476).
What is the square root of 10558?
About 102.7521.
Is 10558 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 10558?
10558 is a semiprime: 2 × 5279, the product of two primes.