The number 10162
10162 is a composite number with 4 divisors. Its prime factorisation is 2 × 5081. Divisors (4): 1, 2, 5081, 10162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10162: a semiprime: 2 × 5081, the product of two primes.
- 2
10162 is composite. Its prime factorisation is
- 3
The divisors add up to 15246; without 10162 itself that is 5084, so 10162 is deficient (5084 is less than 10162). Euler's totient φ(10162) = 5080 numbers up to 10162 share no factor with it.
- 4
The digits of 10162 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10162 = 2 \times 5081 \]
10162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15246 |
| Euler totient φ(n) | 5080 |
| Square | 103266244 |
| Cube | 1049391571528 |
| Square root | 100.806746 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0162 × |
10162 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and sixty-two |
| Binary (base 2) | 10011110110010 |
| Octal (base 8) | 23662 |
| Hexadecimal (base 16) | 27B2 |
| Base 3 | 111221101 |
| As time | 10162 seconds = 2 h 49 min 22 s |
Is 10162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10162 ÷ 2 = 5081) | 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 5) | 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 9) | 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 10162 a prime number?
No. 10162 = 2 × 5081, so it is divisible by 2.
What are the factors of 10162?
1, 2, 5081, 10162.
What is 10162 in binary?
10011110110010 (hexadecimal 27B2, octal 23662).
What is the square root of 10162?
About 100.8067.
Is 10162 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10162?
10162 is a semiprime: 2 × 5081, the product of two primes.