The number 25591
25591 is a composite number with 4 divisors. Its prime factorisation is 157 × 163. Divisors (4): 1, 157, 163, 25591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25591: a semiprime: 157 × 163, the product of two primes.
- 2
25591 is composite. Its prime factorisation is
- 3
The divisors add up to 25912; without 25591 itself that is 321, so 25591 is deficient (321 is less than 25591). Euler's totient φ(25591) = 25272 numbers up to 25591 share no factor with it.
- 4
The digits of 25591 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 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25591 = 157 \times 163 \]
25591 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 25912 |
| Euler totient φ(n) | 25272 |
| Square | 654899281 |
| Cube | 16759527500071 |
| Square root | 159.971873 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5591 × |
25591 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand five hundred and ninety-one |
| Binary (base 2) | 110001111110111 |
| Octal (base 8) | 61767 |
| Hexadecimal (base 16) | 63F7 |
| Base 3 | 1022002211 |
| As time | 25591 seconds = 7 h 6 min 31 s |
Is 25591 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 6) | 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 7) | 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 | No (remainder 5) | 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 25591 a prime number?
No. 25591 = 157 × 163, so it is divisible by 157.
What are the factors of 25591?
1, 157, 163, 25591.
What is 25591 in binary?
110001111110111 (hexadecimal 63F7, octal 61767).
What is the square root of 25591?
About 159.9719.
Is 25591 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 25591?
25591 is a semiprime: 157 × 163, the product of two primes.