The number 25390
25390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2539. Divisors (8): 1, 2, 5, 10, 2539, 5078, 12695, 25390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25390 is composite. Its prime factorisation is
- 3
The divisors add up to 45720; without 25390 itself that is 20330, so 25390 is deficient (20330 is less than 25390). Euler's totient φ(25390) = 10152 numbers up to 25390 share no factor with it.
- 4
The digits of 25390 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 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25390 = 2 \times 5 \times 2539 \]
25390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 45720 |
| Euler totient φ(n) | 10152 |
| Square | 644652100 |
| Cube | 16367716819000 |
| Square root | 159.342399 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 38 |
| Scientific notation | 2.539 × |
25390 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand three hundred and ninety |
| Binary (base 2) | 110001100101110 |
| Octal (base 8) | 61456 |
| Hexadecimal (base 16) | 632E |
| Base 3 | 1021211101 |
| As time | 25390 seconds = 7 h 3 min 10 s |
Is 25390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25390 ÷ 2 = 12695) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (25390 ÷ 5 = 5078) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | 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 | Yes (25390 ÷ 10 = 2539) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25390 a prime number?
No. 25390 = 2 × 5 × 2539, so it is divisible by 2.
What are the factors of 25390?
1, 2, 5, 10, 2539, 5078, 12695, 25390.
What is 25390 in binary?
110001100101110 (hexadecimal 632E, octal 61456).
What is the square root of 25390?
About 159.3424.
Is 25390 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 25390?
It is a composite number with 8 divisors.