The number 25861
25861 is a composite number with 4 divisors. Its prime factorisation is 11 × 2351. Divisors (4): 1, 11, 2351, 25861.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25861: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 2351, the product of two primes.
- 2
25861 is composite. Its prime factorisation is
- 3
The divisors add up to 28224; without 25861 itself that is 2363, so 25861 is deficient (2363 is less than 25861). Euler's totient φ(25861) = 23500 numbers up to 25861 share no factor with it.
- 4
The digits of 25861 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 25 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25861 = 11 \times 2351 \]
25861 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 28224 |
| Euler totient φ(n) | 23500 |
| Square | 668791321 |
| Cube | 17295612352381 |
| Square root | 160.813557 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 25 |
| Scientific notation | 2.5861 × |
25861 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand eight hundred and sixty-one |
| Binary (base 2) | 110010100000101 |
| Octal (base 8) | 62405 |
| Hexadecimal (base 16) | 6505 |
| Base 3 | 1022110211 |
| As time | 25861 seconds = 7 h 11 min 1 s |
Is 25861 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (25861 ÷ 11 = 2351) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25861 a prime number?
No. 25861 = 11 × 2351, so it is divisible by 11.
What are the factors of 25861?
1, 11, 2351, 25861.
What is 25861 in binary?
110010100000101 (hexadecimal 6505, octal 62405).
What is the square root of 25861?
About 160.8136.
Is 25861 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 25861?
25861 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 2351, the product of two primes.