The number 25791
25791 is a composite number with 4 divisors. Its prime factorisation is 3 × 8597. Divisors (4): 1, 3, 8597, 25791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25791: a semiprime: 3 × 8597, the product of two primes.
- 2
25791 is composite. Its prime factorisation is
- 3
The divisors add up to 34392; without 25791 itself that is 8601, so 25791 is deficient (8601 is less than 25791). Euler's totient φ(25791) = 17192 numbers up to 25791 share no factor with it.
- 4
The digits of 25791 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 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25791 = 3 \times 8597 \]
25791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 34392 |
| Euler totient φ(n) | 17192 |
| Square | 665175681 |
| Cube | 17155545988671 |
| Square root | 160.595766 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5791 × |
25791 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand seven hundred and ninety-one |
| Binary (base 2) | 110010010111111 |
| Octal (base 8) | 62277 |
| Hexadecimal (base 16) | 64BF |
| Base 3 | 1022101020 |
| As time | 25791 seconds = 7 h 9 min 51 s |
Is 25791 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 | Yes (25791 ÷ 3 = 8597) | 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 3) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25791 a prime number?
No. 25791 = 3 × 8597, so it is divisible by 3.
What are the factors of 25791?
1, 3, 8597, 25791.
What is 25791 in binary?
110010010111111 (hexadecimal 64BF, octal 62277).
What is the square root of 25791?
About 160.5958.
Is 25791 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 25791?
25791 is a semiprime: 3 × 8597, the product of two primes.