The number 25202
25202 is a composite number with 4 divisors. Its prime factorisation is 2 × 12601. Divisors (4): 1, 2, 12601, 25202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25202: a semiprime: 2 × 12601, the product of two primes.
- 2
25202 is composite. Its prime factorisation is
- 3
The divisors add up to 37806; without 25202 itself that is 12604, so 25202 is deficient (12604 is less than 25202). Euler's totient φ(25202) = 12600 numbers up to 25202 share no factor with it.
- 4
The digits of 25202 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 157 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25202 = 2 \times 12601 \]
25202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 37806 |
| Euler totient φ(n) | 12600 |
| Square | 635140804 |
| Cube | 16006818542408 |
| Square root | 158.751378 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 157 |
| Scientific notation | 2.5202 × |
25202 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand two hundred and two |
| Binary (base 2) | 110001001110010 |
| Octal (base 8) | 61162 |
| Hexadecimal (base 16) | 6272 |
| Base 3 | 1021120102 |
| As time | 25202 seconds = 7 h 0 min 2 s |
Is 25202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25202 ÷ 2 = 12601) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25202 a prime number?
No. 25202 = 2 × 12601, so it is divisible by 2.
What are the factors of 25202?
1, 2, 12601, 25202.
What is 25202 in binary?
110001001110010 (hexadecimal 6272, octal 61162).
What is the square root of 25202?
About 158.7514.
Is 25202 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 25202?
25202 is a semiprime: 2 × 12601, the product of two primes.