The number 25590
25590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 853. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 853, 1706, 2559, 4265, 5118, 8530, 12795, 25590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25590 is composite. Its prime factorisation is
- 3
The divisors add up to 61488; without 25590 itself that is 35898, so 25590 is abundant (35898 is more than 25590). Euler's totient φ(25590) = 6816 numbers up to 25590 share no factor with it.
- 4
The digits of 25590 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25590 = 2 \times 3 \times 5 \times 853 \]
25590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 61488 |
| Euler totient φ(n) | 6816 |
| Square | 654848100 |
| Cube | 16757562879000 |
| Square root | 159.968747 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.559 × |
25590 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand five hundred and ninety |
| Binary (base 2) | 110001111110110 |
| Octal (base 8) | 61766 |
| Hexadecimal (base 16) | 63F6 |
| Base 3 | 1022002210 |
| As time | 25590 seconds = 7 h 6 min 30 s |
Is 25590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25590 ÷ 2 = 12795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (25590 ÷ 3 = 8530) | 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 | Yes (25590 ÷ 5 = 5118) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (25590 ÷ 6 = 4265) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (25590 ÷ 10 = 2559) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25590 a prime number?
No. 25590 = 2 × 3 × 5 × 853, so it is divisible by 2.
What are the factors of 25590?
1, 2, 3, 5, 6, 10, 15, 30, 853, 1706, 2559, 4265, 5118, 8530, 12795, 25590.
What is 25590 in binary?
110001111110110 (hexadecimal 63F6, octal 61766).
What is the square root of 25590?
About 159.9687.
Is 25590 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 25590?
It is a composite number with 16 divisors.