The number 25490
25490 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2549. Divisors (8): 1, 2, 5, 10, 2549, 5098, 12745, 25490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25490 is composite. Its prime factorisation is
- 3
The divisors add up to 45900; without 25490 itself that is 20410, so 25490 is deficient (20410 is less than 25490). Euler's totient φ(25490) = 10192 numbers up to 25490 share no factor with it.
- 4
The digits of 25490 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
\[ 25490 = 2 \times 5 \times 2549 \]
25490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 45900 |
| Euler totient φ(n) | 10192 |
| Square | 649740100 |
| Cube | 16561875149000 |
| Square root | 159.655880 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.549 × |
25490 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand four hundred and ninety |
| Binary (base 2) | 110001110010010 |
| Octal (base 8) | 61622 |
| Hexadecimal (base 16) | 6392 |
| Base 3 | 1021222002 |
| As time | 25490 seconds = 7 h 4 min 50 s |
Is 25490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25490 ÷ 2 = 12745) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (25490 ÷ 5 = 5098) | 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 2) | 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 | Yes (25490 ÷ 10 = 2549) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25490 a prime number?
No. 25490 = 2 × 5 × 2549, so it is divisible by 2.
What are the factors of 25490?
1, 2, 5, 10, 2549, 5098, 12745, 25490.
What is 25490 in binary?
110001110010010 (hexadecimal 6392, octal 61622).
What is the square root of 25490?
About 159.6559.
Is 25490 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 25490?
It is a composite number with 8 divisors.