The number 25481
25481 is a composite number with 4 divisors. Its prime factorisation is 83 × 307. Divisors (4): 1, 83, 307, 25481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25481: a semiprime: 83 × 307, the product of two primes.
- 2
25481 is composite. Its prime factorisation is
- 3
The divisors add up to 25872; without 25481 itself that is 391, so 25481 is deficient (391 is less than 25481). Euler's totient φ(25481) = 25092 numbers up to 25481 share no factor with it.
- 4
The digits of 25481 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 108 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25481 = 83 \times 307 \]
25481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 25872 |
| Euler totient φ(n) | 25092 |
| Square | 649281361 |
| Cube | 16544338359641 |
| Square root | 159.627692 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 108 |
| Scientific notation | 2.5481 × |
25481 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand four hundred and eighty-one |
| Binary (base 2) | 110001110001001 |
| Octal (base 8) | 61611 |
| Hexadecimal (base 16) | 6389 |
| Base 3 | 1021221202 |
| As time | 25481 seconds = 7 h 4 min 41 s |
Is 25481 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25481 a prime number?
No. 25481 = 83 × 307, so it is divisible by 83.
What are the factors of 25481?
1, 83, 307, 25481.
What is 25481 in binary?
110001110001001 (hexadecimal 6389, octal 61611).
What is the square root of 25481?
About 159.6277.
Is 25481 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 25481?
25481 is a semiprime: 83 × 307, the product of two primes.