The number 61202
61202 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 431. Divisors (8): 1, 2, 71, 142, 431, 862, 30601, 61202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61202 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61202 is composite. Its prime factorisation is
- 3
The divisors add up to 93312; without 61202 itself that is 32110, so 61202 is deficient (32110 is less than 61202). Euler's totient φ(61202) = 30100 numbers up to 61202 share no factor with it.
- 4
The digits of 61202 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61202 = 2 \times 71 \times 431 \]
61202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93312 |
| Euler totient φ(n) | 30100 |
| Square | 3745684804 |
| Cube | 229243401374408 |
| Square root | 247.390380 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.1202 × |
61202 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand two hundred and two |
| Binary (base 2) | 1110111100010010 |
| Octal (base 8) | 167422 |
| Hexadecimal (base 16) | EF12 |
| Base 3 | 10002221202 |
| As time | 61202 seconds = 17 h 0 min 2 s |
Is 61202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61202 ÷ 2 = 30601) | 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 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 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 9) | 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 61202 a prime number?
No. 61202 = 2 × 71 × 431, so it is divisible by 2.
What are the factors of 61202?
1, 2, 71, 142, 431, 862, 30601, 61202.
What is 61202 in binary?
1110111100010010 (hexadecimal EF12, octal 167422).
What is the square root of 61202?
About 247.3904.
Is 61202 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 61202?
It is a composite number with 8 divisors.