The number 25558
25558 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 983. Divisors (8): 1, 2, 13, 26, 983, 1966, 12779, 25558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25558 is composite. Its prime factorisation is
- 3
The divisors add up to 41328; without 25558 itself that is 15770, so 25558 is deficient (15770 is less than 25558). Euler's totient φ(25558) = 11784 numbers up to 25558 share no factor with it.
- 4
The digits of 25558 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 157 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25558 = 2 \times 13 \times 983 \]
25558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41328 |
| Euler totient φ(n) | 11784 |
| Square | 653211364 |
| Cube | 16694776041112 |
| Square root | 159.868696 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 157 |
| Scientific notation | 2.5558 × |
25558 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand five hundred and fifty-eight |
| Binary (base 2) | 110001111010110 |
| Octal (base 8) | 61726 |
| Hexadecimal (base 16) | 63D6 |
| Base 3 | 1022001121 |
| As time | 25558 seconds = 7 h 5 min 58 s |
Is 25558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25558 ÷ 2 = 12779) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | 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 25558 a prime number?
No. 25558 = 2 × 13 × 983, so it is divisible by 2.
What are the factors of 25558?
1, 2, 13, 26, 983, 1966, 12779, 25558.
What is 25558 in binary?
110001111010110 (hexadecimal 63D6, octal 61726).
What is the square root of 25558?
About 159.8687.
Is 25558 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 25558?
It is a composite number with 8 divisors.