The number 25335
25335 is a composite number with 12 divisors. Its prime factorisation is × 5 × 563. Divisors (12): 1, 3, 5, 9, 15, 45, 563, 1689, 2815, 5067, 8445, 25335.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25335 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25335 is composite. Its prime factorisation is
- 3
The divisors add up to 43992; without 25335 itself that is 18657, so 25335 is deficient (18657 is less than 25335). Euler's totient φ(25335) = 13488 numbers up to 25335 share no factor with it.
- 4
The digits of 25335 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25335 = 3^{2} \times 5 \times 563 \]25335 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 43992 |
| Euler totient φ(n) | 13488 |
| Square | 641862225 |
| Cube | 16261579470375 |
| Square root | 159.169721 (= 3√2815) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.5335 × |
25335 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand three hundred and thirty-five |
| Binary (base 2) | 110001011110111 |
| Octal (base 8) | 61367 |
| Hexadecimal (base 16) | 62F7 |
| Base 3 | 1021202100 |
| As time | 25335 seconds = 7 h 2 min 15 s |
Is 25335 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 (25335 ÷ 3 = 8445) | 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 (25335 ÷ 5 = 5067) | 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 2) | 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 (25335 ÷ 9 = 2815) | 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 2) | 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 25335 a prime number?
No. 25335 = × 5 × 563, so it is divisible by 3.
What are the factors of 25335?
1, 3, 5, 9, 15, 45, 563, 1689, 2815, 5067, 8445, 25335.
What is 25335 in binary?
110001011110111 (hexadecimal 62F7, octal 61367).
What is the square root of 25335?
About 159.1697, exactly 3√2815.
Is 25335 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 25335?
It is a composite number with 12 divisors.