The number 25991
25991 is a composite number with 8 divisors. Its prime factorisation is 7 × 47 × 79. Divisors (8): 1, 7, 47, 79, 329, 553, 3713, 25991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25991: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
25991 is composite. Its prime factorisation is
- 3
The divisors add up to 30720; without 25991 itself that is 4729, so 25991 is deficient (4729 is less than 25991). Euler's totient φ(25991) = 21528 numbers up to 25991 share no factor with it.
- 4
The digits of 25991 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 139 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25991 = 7 \times 47 \times 79 \]
25991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30720 |
| Euler totient φ(n) | 21528 |
| Square | 675532081 |
| Cube | 17557754317271 |
| Square root | 161.217245 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 139 |
| Scientific notation | 2.5991 × |
25991 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and ninety-one |
| Binary (base 2) | 110010110000111 |
| Octal (base 8) | 62607 |
| Hexadecimal (base 16) | 6587 |
| Base 3 | 1022122122 |
| As time | 25991 seconds = 7 h 13 min 11 s |
Is 25991 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (25991 ÷ 7 = 3713) | 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 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25991 a prime number?
No. 25991 = 7 × 47 × 79, so it is divisible by 7.
What are the factors of 25991?
1, 7, 47, 79, 329, 553, 3713, 25991.
What is 25991 in binary?
110010110000111 (hexadecimal 6587, octal 62607).
What is the square root of 25991?
About 161.2172.
Is 25991 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 25991?
25991 is a happy number: repeatedly adding the squares of its digits reaches 1.