The number 16371
16371 is a composite number with 12 divisors. Its prime factorisation is × 17 × 107. Divisors (12): 1, 3, 9, 17, 51, 107, 153, 321, 963, 1819, 5457, 16371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16371 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16371 is composite. Its prime factorisation is
- 3
The divisors add up to 25272; without 16371 itself that is 8901, so 16371 is deficient (8901 is less than 16371). Euler's totient φ(16371) = 10176 numbers up to 16371 share no factor with it.
- 4
The digits of 16371 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16371 = 3^{2} \times 17 \times 107 \]16371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 25272 |
| Euler totient φ(n) | 10176 |
| Square | 268009641 |
| Cube | 4387585832811 |
| Square root | 127.949209 (= 3√1819) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.6371 × |
16371 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and seventy-one |
| Binary (base 2) | 11111111110011 |
| Octal (base 8) | 37763 |
| Hexadecimal (base 16) | 3FF3 |
| Base 3 | 211110100 |
| As time | 16371 seconds = 4 h 32 min 51 s |
Is 16371 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 | Yes (16371 ÷ 3 = 5457) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16371 ÷ 9 = 1819) | 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 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16371 a prime number?
No. 16371 = × 17 × 107, so it is divisible by 3.
What are the factors of 16371?
1, 3, 9, 17, 51, 107, 153, 321, 963, 1819, 5457, 16371.
What is 16371 in binary?
11111111110011 (hexadecimal 3FF3, octal 37763).
What is the square root of 16371?
About 127.9492, exactly 3√1819.
Is 16371 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 16371?
It is a composite number with 12 divisors.