The number 25566
25566 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 4261. Divisors (8): 1, 2, 3, 6, 4261, 8522, 12783, 25566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25566 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25566 is composite. Its prime factorisation is
- 3
The divisors add up to 51144; without 25566 itself that is 25578, so 25566 is abundant (25578 is more than 25566). Euler's totient φ(25566) = 8520 numbers up to 25566 share no factor with it.
- 4
The digits of 25566 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 201 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25566 = 2 \times 3 \times 4261 \]
25566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51144 |
| Euler totient φ(n) | 8520 |
| Square | 653620356 |
| Cube | 16710458021496 |
| Square root | 159.893715 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 201 |
| Scientific notation | 2.5566 × |
25566 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand five hundred and sixty-six |
| Binary (base 2) | 110001111011110 |
| Octal (base 8) | 61736 |
| Hexadecimal (base 16) | 63DE |
| Base 3 | 1022001220 |
| As time | 25566 seconds = 7 h 6 min 6 s |
Is 25566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25566 ÷ 2 = 12783) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (25566 ÷ 3 = 8522) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (25566 ÷ 6 = 4261) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 25566 a prime number?
No. 25566 = 2 × 3 × 4261, so it is divisible by 2.
What are the factors of 25566?
1, 2, 3, 6, 4261, 8522, 12783, 25566.
What is 25566 in binary?
110001111011110 (hexadecimal 63DE, octal 61736).
What is the square root of 25566?
About 159.8937.
Is 25566 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 25566?
It is a composite number with 8 divisors.