The number 25961
25961 is a composite number with 4 divisors. Its prime factorisation is 13 × 1997. Divisors (4): 1, 13, 1997, 25961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25961: a semiprime: 13 × 1997, the product of two primes.
- 2
25961 is composite. Its prime factorisation is
- 3
The divisors add up to 27972; without 25961 itself that is 2011, so 25961 is deficient (2011 is less than 25961). Euler's totient φ(25961) = 23952 numbers up to 25961 share no factor with it.
- 4
The digits of 25961 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 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25961 = 13 \times 1997 \]
25961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27972 |
| Euler totient φ(n) | 23952 |
| Square | 673973521 |
| Cube | 17497026578681 |
| Square root | 161.124176 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 51 |
| Scientific notation | 2.5961 × |
25961 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and sixty-one |
| Binary (base 2) | 110010101101001 |
| Octal (base 8) | 62551 |
| Hexadecimal (base 16) | 6569 |
| Base 3 | 1022121112 |
| As time | 25961 seconds = 7 h 12 min 41 s |
Is 25961 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 2) | 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 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25961 a prime number?
No. 25961 = 13 × 1997, so it is divisible by 13.
What are the factors of 25961?
1, 13, 1997, 25961.
What is 25961 in binary?
110010101101001 (hexadecimal 6569, octal 62551).
What is the square root of 25961?
About 161.1242.
Is 25961 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 25961?
25961 is a semiprime: 13 × 1997, the product of two primes.