The number 25491
25491 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 293. Divisors (8): 1, 3, 29, 87, 293, 879, 8497, 25491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25491 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25491 is composite. Its prime factorisation is
- 3
The divisors add up to 35280; without 25491 itself that is 9789, so 25491 is deficient (9789 is less than 25491). Euler's totient φ(25491) = 16352 numbers up to 25491 share no factor with it.
- 4
The digits of 25491 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25491 = 3 \times 29 \times 293 \]
25491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 35280 |
| Euler totient φ(n) | 16352 |
| Square | 649791081 |
| Cube | 16563824445771 |
| Square root | 159.659012 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.5491 × |
25491 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand four hundred and ninety-one |
| Binary (base 2) | 110001110010011 |
| Octal (base 8) | 61623 |
| Hexadecimal (base 16) | 6393 |
| Base 3 | 1021222010 |
| As time | 25491 seconds = 7 h 4 min 51 s |
Is 25491 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 (25491 ÷ 3 = 8497) | 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 | No (remainder 1) | 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 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 25491 a prime number?
No. 25491 = 3 × 29 × 293, so it is divisible by 3.
What are the factors of 25491?
1, 3, 29, 87, 293, 879, 8497, 25491.
What is 25491 in binary?
110001110010011 (hexadecimal 6393, octal 61623).
What is the square root of 25491?
About 159.6590.
Is 25491 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 25491?
It is a composite number with 8 divisors.