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