The number 25891
25891 is a composite number with 4 divisors. Its prime factorisation is 17 × 1523. Divisors (4): 1, 17, 1523, 25891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25891: a semiprime: 17 × 1523, the product of two primes.
- 2
25891 is composite. Its prime factorisation is
- 3
The divisors add up to 27432; without 25891 itself that is 1541, so 25891 is deficient (1541 is less than 25891). Euler's totient φ(25891) = 24352 numbers up to 25891 share no factor with it.
- 4
The digits of 25891 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 126 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25891 = 17 \times 1523 \]
25891 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27432 |
| Euler totient φ(n) | 24352 |
| Square | 670343881 |
| Cube | 17355873422971 |
| Square root | 160.906805 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 126 |
| Scientific notation | 2.5891 × |
25891 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand eight hundred and ninety-one |
| Binary (base 2) | 110010100100011 |
| Octal (base 8) | 62443 |
| Hexadecimal (base 16) | 6523 |
| Base 3 | 1022111221 |
| As time | 25891 seconds = 7 h 11 min 31 s |
Is 25891 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 3) | 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 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25891 a prime number?
No. 25891 = 17 × 1523, so it is divisible by 17.
What are the factors of 25891?
1, 17, 1523, 25891.
What is 25891 in binary?
110010100100011 (hexadecimal 6523, octal 62443).
What is the square root of 25891?
About 160.9068.
Is 25891 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 25891?
25891 is a semiprime: 17 × 1523, the product of two primes.