The number 25141
25141 is a composite number with 4 divisors. Its prime factorisation is 31 × 811. Divisors (4): 1, 31, 811, 25141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25141: a semiprime: 31 × 811, the product of two primes.
- 2
25141 is composite. Its prime factorisation is
- 3
The divisors add up to 25984; without 25141 itself that is 843, so 25141 is deficient (843 is less than 25141). Euler's totient φ(25141) = 24300 numbers up to 25141 share no factor with it.
- 4
The digits of 25141 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 126 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25141 = 31 \times 811 \]
25141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 25984 |
| Euler totient φ(n) | 24300 |
| Square | 632069881 |
| Cube | 15890868878221 |
| Square root | 158.559137 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 126 |
| Scientific notation | 2.5141 × |
25141 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand one hundred and forty-one |
| Binary (base 2) | 110001000110101 |
| Octal (base 8) | 61065 |
| Hexadecimal (base 16) | 6235 |
| Base 3 | 1021111011 |
| As time | 25141 seconds = 6 h 59 min 1 s |
Is 25141 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 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 6) | 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 25141 a prime number?
No. 25141 = 31 × 811, so it is divisible by 31.
What are the factors of 25141?
1, 31, 811, 25141.
What is 25141 in binary?
110001000110101 (hexadecimal 6235, octal 61065).
What is the square root of 25141?
About 158.5591.
Is 25141 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 25141?
25141 is a semiprime: 31 × 811, the product of two primes.