The number 16146
16146 is a composite number with 32 divisors. Its prime factorisation is 2 × × 13 × 23. Divisors (32): 1, 2, 3, 6, 9, 13, 18, 23, 26, 27, 39, 46, 54, 69, 78, 117 … 16146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16146: a Harshad number: divisible by its digit sum 18.
- 2
16146 is composite. Its prime factorisation is
- 3
The divisors add up to 40320; without 16146 itself that is 24174, so 16146 is abundant (24174 is more than 16146). Euler's totient φ(16146) = 4752 numbers up to 16146 share no factor with it.
- 4
The digits of 16146 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16146 = 2 \times 3^{3} \times 13 \times 23 \]16146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 40320 |
| Euler totient φ(n) | 4752 |
| Square | 260693316 |
| Cube | 4209154280136 |
| Square root | 127.066912 (= 3√1794) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6146 × |
16146 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and forty-six |
| Binary (base 2) | 11111100010010 |
| Octal (base 8) | 37422 |
| Hexadecimal (base 16) | 3F12 |
| Base 3 | 211011000 |
| As time | 16146 seconds = 4 h 29 min 6 s |
Is 16146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16146 ÷ 2 = 8073) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16146 ÷ 3 = 5382) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16146 ÷ 6 = 2691) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (16146 ÷ 9 = 1794) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16146 a prime number?
No. 16146 = 2 × × 13 × 23, so it is divisible by 2.
What are the factors of 16146?
1, 2, 3, 6, 9, 13, 18, 23, 26, 27, 39, 46, 54, 69, 78, 117, 138, 207, 234, 299, 351, 414, 598, 621, 702, 897, 1242, 1794, 2691, 5382, 8073, 16146.
What is 16146 in binary?
11111100010010 (hexadecimal 3F12, octal 37422).
What is the square root of 16146?
About 127.0669, exactly 3√1794.
Is 16146 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 16146?
16146 is a Harshad number: divisible by its digit sum 18.