The number 25831
25831 is a composite number with 4 divisors. Its prime factorisation is 13 × 1987. Divisors (4): 1, 13, 1987, 25831.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25831: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1987, the product of two primes.
- 2
25831 is composite. Its prime factorisation is
- 3
The divisors add up to 27832; without 25831 itself that is 2001, so 25831 is deficient (2001 is less than 25831). Euler's totient φ(25831) = 23832 numbers up to 25831 share no factor with it.
- 4
The digits of 25831 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 170 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25831 = 13 \times 1987 \]
25831 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27832 |
| Euler totient φ(n) | 23832 |
| Square | 667240561 |
| Cube | 17235490931191 |
| Square root | 160.720254 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 170 |
| Scientific notation | 2.5831 × |
25831 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand eight hundred and thirty-one |
| Binary (base 2) | 110010011100111 |
| Octal (base 8) | 62347 |
| Hexadecimal (base 16) | 64E7 |
| Base 3 | 1022102201 |
| As time | 25831 seconds = 7 h 10 min 31 s |
Is 25831 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 1) | 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 1) | 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 3) | 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 25831 a prime number?
No. 25831 = 13 × 1987, so it is divisible by 13.
What are the factors of 25831?
1, 13, 1987, 25831.
What is 25831 in binary?
110010011100111 (hexadecimal 64E7, octal 62347).
What is the square root of 25831?
About 160.7203.
Is 25831 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 25831?
25831 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1987, the product of two primes.