The number 56162
56162 is a composite number with 4 divisors. Its prime factorisation is 2 × 28081. Divisors (4): 1, 2, 28081, 56162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56162: a semiprime: 2 × 28081, the product of two primes.
- 2
56162 is composite. Its prime factorisation is
- 3
The divisors add up to 84246; without 56162 itself that is 28084, so 56162 is deficient (28084 is less than 56162). Euler's totient φ(56162) = 28080 numbers up to 56162 share no factor with it.
- 4
The digits of 56162 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56162 = 2 \times 28081 \]
56162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84246 |
| Euler totient φ(n) | 28080 |
| Square | 3154170244 |
| Cube | 177144509243528 |
| Square root | 236.985232 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.6162 × |
56162 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and sixty-two |
| Binary (base 2) | 1101101101100010 |
| Octal (base 8) | 155542 |
| Hexadecimal (base 16) | DB62 |
| Base 3 | 2212001002 |
| As time | 56162 seconds = 15 h 36 min 2 s |
Is 56162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56162 ÷ 2 = 28081) | 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 7) | 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 56162 a prime number?
No. 56162 = 2 × 28081, so it is divisible by 2.
What are the factors of 56162?
1, 2, 28081, 56162.
What is 56162 in binary?
1101101101100010 (hexadecimal DB62, octal 155542).
What is the square root of 56162?
About 236.9852.
Is 56162 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56162?
56162 is a semiprime: 2 × 28081, the product of two primes.