The number 25931
25931 is a twin prime (25931 and 25933 are both prime) and the 2852nd prime number. Its only divisors are 1 and 25931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25931: a twin prime (25931 and 25933 are both prime); the 2852nd prime number.
- 2
25931 is prime, so its only factors are 1 and 25931. It is the 2852nd prime; the next prime is 25933 and the one before is 25919.
- 3
The divisors add up to 25932; without 25931 itself that is 1, so 25931 is deficient (1 is less than 25931). Euler's totient φ(25931) = 25930 numbers up to 25931 share no factor with it.
- 4
The digits of 25931 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 170 steps to reach 1.
25931 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 25932 |
| Euler totient φ(n) | 25930 |
| Square | 672416761 |
| Cube | 17436439029491 |
| Square root | 161.031053 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 170 |
| Scientific notation | 2.5931 × |
25931 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and thirty-one |
| Binary (base 2) | 110010101001011 |
| Octal (base 8) | 62513 |
| Hexadecimal (base 16) | 654B |
| Base 3 | 1022120102 |
| As time | 25931 seconds = 7 h 12 min 11 s |
Is 25931 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 | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | 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 25931 a prime number?
Yes. 25931 is divisible only by 1 and itself.
What are the factors of 25931?
1, 25931.
What is 25931 in binary?
110010101001011 (hexadecimal 654B, octal 62513).
What is the square root of 25931?
About 161.0311.
Is 25931 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 25931?
25931 is a twin prime (25931 and 25933 are both prime); the 2852nd prime number.