The number 25695
25695 is a composite number with 12 divisors. Its prime factorisation is × 5 × 571. Divisors (12): 1, 3, 5, 9, 15, 45, 571, 1713, 2855, 5139, 8565, 25695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25695 is composite. Its prime factorisation is
- 3
The divisors add up to 44616; without 25695 itself that is 18921, so 25695 is deficient (18921 is less than 25695). Euler's totient φ(25695) = 13680 numbers up to 25695 share no factor with it.
- 4
The digits of 25695 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25695 = 3^{2} \times 5 \times 571 \]25695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 44616 |
| Euler totient φ(n) | 13680 |
| Square | 660233025 |
| Cube | 16964687577375 |
| Square root | 160.296600 (= 3√2855) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5695 × |
25695 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand six hundred and ninety-five |
| Binary (base 2) | 110010001011111 |
| Octal (base 8) | 62137 |
| Hexadecimal (base 16) | 645F |
| Base 3 | 1022020200 |
| As time | 25695 seconds = 7 h 8 min 15 s |
Is 25695 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 (25695 ÷ 3 = 8565) | 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 | Yes (25695 ÷ 5 = 5139) | 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 5) | 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 | Yes (25695 ÷ 9 = 2855) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 25695 a prime number?
No. 25695 = × 5 × 571, so it is divisible by 3.
What are the factors of 25695?
1, 3, 5, 9, 15, 45, 571, 1713, 2855, 5139, 8565, 25695.
What is 25695 in binary?
110010001011111 (hexadecimal 645F, octal 62137).
What is the square root of 25695?
About 160.2966, exactly 3√2855.
Is 25695 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 25695?
It is a composite number with 12 divisors.