The number 25935
25935 is a composite number with 32 divisors. Its prime factorisation is 3 × 5 × 7 × 13 × 19. Divisors (32): 1, 3, 5, 7, 13, 15, 19, 21, 35, 39, 57, 65, 91, 95, 105, 133 … 25935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25935 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25935 is composite. Its prime factorisation is
- 3
The divisors add up to 53760; without 25935 itself that is 27825, so 25935 is abundant (27825 is more than 25935). Euler's totient φ(25935) = 10368 numbers up to 25935 share no factor with it.
- 4
The digits of 25935 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 108 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25935 = 3 \times 5 \times 7 \times 13 \times 19 \]
25935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 53760 |
| Euler totient φ(n) | 10368 |
| Square | 672624225 |
| Cube | 17444509275375 |
| Square root | 161.043472 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 108 |
| Scientific notation | 2.5935 × |
25935 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and thirty-five |
| Binary (base 2) | 110010101001111 |
| Octal (base 8) | 62517 |
| Hexadecimal (base 16) | 654F |
| Base 3 | 1022120120 |
| As time | 25935 seconds = 7 h 12 min 15 s |
Is 25935 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 (25935 ÷ 3 = 8645) | 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 (25935 ÷ 5 = 5187) | 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 | Yes (25935 ÷ 7 = 3705) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 25935 a prime number?
No. 25935 = 3 × 5 × 7 × 13 × 19, so it is divisible by 3.
What are the factors of 25935?
1, 3, 5, 7, 13, 15, 19, 21, 35, 39, 57, 65, 91, 95, 105, 133, 195, 247, 273, 285, 399, 455, 665, 741, 1235, 1365, 1729, 1995, 3705, 5187, 8645, 25935.
What is 25935 in binary?
110010101001111 (hexadecimal 654F, octal 62517).
What is the square root of 25935?
About 161.0435.
Is 25935 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 25935?
It is a composite number with 32 divisors.