The number 51202
51202 is a composite number with 4 divisors. Its prime factorisation is 2 × 25601. Divisors (4): 1, 2, 25601, 51202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51202: a semiprime: 2 × 25601, the product of two primes.
- 2
51202 is composite. Its prime factorisation is
- 3
The divisors add up to 76806; without 51202 itself that is 25604, so 51202 is deficient (25604 is less than 51202). Euler's totient φ(51202) = 25600 numbers up to 51202 share no factor with it.
- 4
The digits of 51202 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51202 = 2 \times 25601 \]
51202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76806 |
| Euler totient φ(n) | 25600 |
| Square | 2621644804 |
| Cube | 134233457254408 |
| Square root | 226.278589 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1202 × |
51202 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and two |
| Binary (base 2) | 1100100000000010 |
| Octal (base 8) | 144002 |
| Hexadecimal (base 16) | C802 |
| Base 3 | 2121020101 |
| As time | 51202 seconds = 14 h 13 min 22 s |
Is 51202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51202 ÷ 2 = 25601) | 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 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51202 a prime number?
No. 51202 = 2 × 25601, so it is divisible by 2.
What are the factors of 51202?
1, 2, 25601, 51202.
What is 51202 in binary?
1100100000000010 (hexadecimal C802, octal 144002).
What is the square root of 51202?
About 226.2786.
Is 51202 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51202?
51202 is a semiprime: 2 × 25601, the product of two primes.