The number 16370
16370 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1637. Divisors (8): 1, 2, 5, 10, 1637, 3274, 8185, 16370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16370 is composite. Its prime factorisation is
- 3
The divisors add up to 29484; without 16370 itself that is 13114, so 16370 is deficient (13114 is less than 16370). Euler's totient φ(16370) = 6544 numbers up to 16370 share no factor with it.
- 4
The digits of 16370 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16370 = 2 \times 5 \times 1637 \]
16370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29484 |
| Euler totient φ(n) | 6544 |
| Square | 267976900 |
| Cube | 4386781853000 |
| Square root | 127.945301 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.637 × |
16370 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and seventy |
| Binary (base 2) | 11111111110010 |
| Octal (base 8) | 37762 |
| Hexadecimal (base 16) | 3FF2 |
| Base 3 | 211110022 |
| As time | 16370 seconds = 4 h 32 min 50 s |
Is 16370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16370 ÷ 2 = 8185) | 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 | Yes (16370 ÷ 5 = 3274) | 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 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 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16370 ÷ 10 = 1637) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 16370 a prime number?
No. 16370 = 2 × 5 × 1637, so it is divisible by 2.
What are the factors of 16370?
1, 2, 5, 10, 1637, 3274, 8185, 16370.
What is 16370 in binary?
11111111110010 (hexadecimal 3FF2, octal 37762).
What is the square root of 16370?
About 127.9453.
Is 16370 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 16370?
It is a composite number with 8 divisors.