The number 23558
23558 is a composite number with 4 divisors. Its prime factorisation is 2 × 11779. Divisors (4): 1, 2, 11779, 23558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 23558: a semiprime: 2 × 11779, the product of two primes.
- 2
23558 is composite. Its prime factorisation is
- 3
The divisors add up to 35340; without 23558 itself that is 11782, so 23558 is deficient (11782 is less than 23558). Euler's totient φ(23558) = 11778 numbers up to 23558 share no factor with it.
- 4
The digits of 23558 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 100 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23558 = 2 \times 11779 \]
23558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 35340 |
| Euler totient φ(n) | 11778 |
| Square | 554979364 |
| Cube | 13074203857112 |
| Square root | 153.486156 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 100 |
| Scientific notation | 2.3558 × |
23558 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand five hundred and fifty-eight |
| Binary (base 2) | 101110000000110 |
| Octal (base 8) | 56006 |
| Hexadecimal (base 16) | 5C06 |
| Base 3 | 1012022112 |
| As time | 23558 seconds = 6 h 32 min 38 s |
Is 23558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (23558 ÷ 2 = 11779) | 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 3) | 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 3) | 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 5) | 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 7) | 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 23558 a prime number?
No. 23558 = 2 × 11779, so it is divisible by 2.
What are the factors of 23558?
1, 2, 11779, 23558.
What is 23558 in binary?
101110000000110 (hexadecimal 5C06, octal 56006).
What is the square root of 23558?
About 153.4862.
Is 23558 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 23558?
23558 is a semiprime: 2 × 11779, the product of two primes.