The number 25159
25159 is a composite number with 4 divisors. Its prime factorisation is 139 × 181. Divisors (4): 1, 139, 181, 25159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25159: a semiprime: 139 × 181, the product of two primes.
- 2
25159 is composite. Its prime factorisation is
- 3
The divisors add up to 25480; without 25159 itself that is 321, so 25159 is deficient (321 is less than 25159). Euler's totient φ(25159) = 24840 numbers up to 25159 share no factor with it.
- 4
The digits of 25159 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 157 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25159 = 139 \times 181 \]
25159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 25480 |
| Euler totient φ(n) | 24840 |
| Square | 632975281 |
| Cube | 15925025094679 |
| Square root | 158.615888 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 157 |
| Scientific notation | 2.5159 × |
25159 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand one hundred and fifty-nine |
| Binary (base 2) | 110001001000111 |
| Octal (base 8) | 61107 |
| Hexadecimal (base 16) | 6247 |
| Base 3 | 1021111211 |
| As time | 25159 seconds = 6 h 59 min 19 s |
Is 25159 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 4) | 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 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 25159 a prime number?
No. 25159 = 139 × 181, so it is divisible by 139.
What are the factors of 25159?
1, 139, 181, 25159.
What is 25159 in binary?
110001001000111 (hexadecimal 6247, octal 61107).
What is the square root of 25159?
About 158.6159.
Is 25159 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 25159?
25159 is a semiprime: 139 × 181, the product of two primes.