The number 25051
25051 is a composite number with 8 divisors. Its prime factorisation is 13 × 41 × 47. Divisors (8): 1, 13, 41, 47, 533, 611, 1927, 25051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25051: a Harshad number: divisible by its digit sum 13.
- 2
25051 is composite. Its prime factorisation is
- 3
The divisors add up to 28224; without 25051 itself that is 3173, so 25051 is deficient (3173 is less than 25051). Euler's totient φ(25051) = 22080 numbers up to 25051 share no factor with it.
- 4
The digits of 25051 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 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25051 = 13 \times 41 \times 47 \]
25051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28224 |
| Euler totient φ(n) | 22080 |
| Square | 627552601 |
| Cube | 15720820207651 |
| Square root | 158.275077 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 64 |
| Scientific notation | 2.5051 × |
25051 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand and fifty-one |
| Binary (base 2) | 110000111011011 |
| Octal (base 8) | 60733 |
| Hexadecimal (base 16) | 61DB |
| Base 3 | 1021100211 |
| As time | 25051 seconds = 6 h 57 min 31 s |
Is 25051 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25051 a prime number?
No. 25051 = 13 × 41 × 47, so it is divisible by 13.
What are the factors of 25051?
1, 13, 41, 47, 533, 611, 1927, 25051.
What is 25051 in binary?
110000111011011 (hexadecimal 61DB, octal 60733).
What is the square root of 25051?
About 158.2751.
Is 25051 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 25051?
25051 is a Harshad number: divisible by its digit sum 13.