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