The number 25489
25489 is a composite number with 4 divisors. Its prime factorisation is 71 × 359. Divisors (4): 1, 71, 359, 25489.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25489: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 359, the product of two primes.
- 2
25489 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 25489 itself that is 431, so 25489 is deficient (431 is less than 25489). Euler's totient φ(25489) = 25060 numbers up to 25489 share no factor with it.
- 4
The digits of 25489 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25489 = 71 \times 359 \]
25489 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 25060 |
| Square | 649689121 |
| Cube | 16559926005169 |
| Square root | 159.652748 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.5489 × |
25489 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand four hundred and eighty-nine |
| Binary (base 2) | 110001110010001 |
| Octal (base 8) | 61621 |
| Hexadecimal (base 16) | 6391 |
| Base 3 | 1021222001 |
| As time | 25489 seconds = 7 h 4 min 49 s |
Is 25489 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | 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 1) | 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 | No (remainder 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25489 a prime number?
No. 25489 = 71 × 359, so it is divisible by 71.
What are the factors of 25489?
1, 71, 359, 25489.
What is 25489 in binary?
110001110010001 (hexadecimal 6391, octal 61621).
What is the square root of 25489?
About 159.6527.
Is 25489 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 25489?
25489 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 359, the product of two primes.