The number 25364
25364 is a composite number with 12 divisors. Its prime factorisation is × 17 × 373. Divisors (12): 1, 2, 4, 17, 34, 68, 373, 746, 1492, 6341, 12682, 25364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25364 is composite. Its prime factorisation is
- 3
The divisors add up to 47124; without 25364 itself that is 21760, so 25364 is deficient (21760 is less than 25364). Euler's totient φ(25364) = 11904 numbers up to 25364 share no factor with it.
- 4
The digits of 25364 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 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25364 = 2^{2} \times 17 \times 373 \]25364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 47124 |
| Euler totient φ(n) | 11904 |
| Square | 643332496 |
| Cube | 16317485428544 |
| Square root | 159.260792 (= 2√6341) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.5364 × |
25364 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand three hundred and sixty-four |
| Binary (base 2) | 110001100010100 |
| Octal (base 8) | 61424 |
| Hexadecimal (base 16) | 6314 |
| Base 3 | 1021210102 |
| As time | 25364 seconds = 7 h 2 min 44 s |
Is 25364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25364 ÷ 2 = 12682) | 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 | Yes (25364 ÷ 4 = 6341) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25364 a prime number?
No. 25364 = × 17 × 373, so it is divisible by 2.
What are the factors of 25364?
1, 2, 4, 17, 34, 68, 373, 746, 1492, 6341, 12682, 25364.
What is 25364 in binary?
110001100010100 (hexadecimal 6314, octal 61424).
What is the square root of 25364?
About 159.2608, exactly 2√6341.
Is 25364 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 25364?
It is a composite number with 12 divisors.