The number 16362
16362 is a composite number with 20 divisors. Its prime factorisation is 2 × × 101. Divisors (20): 1, 2, 3, 6, 9, 18, 27, 54, 81, 101, 162, 202, 303, 606, 909, 1818 … 16362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16362: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
16362 is composite. Its prime factorisation is
- 3
The divisors add up to 37026; without 16362 itself that is 20664, so 16362 is abundant (20664 is more than 16362). Euler's totient φ(16362) = 5400 numbers up to 16362 share no factor with it.
- 4
The digits of 16362 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16362 = 2 \times 3^{4} \times 101 \]16362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 37026 |
| Euler totient φ(n) | 5400 |
| Square | 267715044 |
| Cube | 4380353549928 |
| Square root | 127.914034 (= 9√202) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.6362 × |
16362 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and sixty-two |
| Binary (base 2) | 11111111101010 |
| Octal (base 8) | 37752 |
| Hexadecimal (base 16) | 3FEA |
| Base 3 | 211110000 |
| As time | 16362 seconds = 4 h 32 min 42 s |
Is 16362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16362 ÷ 2 = 8181) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16362 ÷ 3 = 5454) | 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 | Yes (16362 ÷ 6 = 2727) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (16362 ÷ 9 = 1818) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16362 a prime number?
No. 16362 = 2 × × 101, so it is divisible by 2.
What are the factors of 16362?
1, 2, 3, 6, 9, 18, 27, 54, 81, 101, 162, 202, 303, 606, 909, 1818, 2727, 5454, 8181, 16362.
What is 16362 in binary?
11111111101010 (hexadecimal 3FEA, octal 37752).
What is the square root of 16362?
About 127.9140, exactly 9√202.
Is 16362 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 16362?
16362 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.