The number 16377
16377 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 103. Divisors (8): 1, 3, 53, 103, 159, 309, 5459, 16377.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16377 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16377 is composite. Its prime factorisation is
- 3
The divisors add up to 22464; without 16377 itself that is 6087, so 16377 is deficient (6087 is less than 16377). Euler's totient φ(16377) = 10608 numbers up to 16377 share no factor with it.
- 4
The digits of 16377 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16377 = 3 \times 53 \times 103 \]
16377 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22464 |
| Euler totient φ(n) | 10608 |
| Square | 268206129 |
| Cube | 4392411774633 |
| Square root | 127.972653 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.6377 × |
16377 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and seventy-seven |
| Binary (base 2) | 11111111111001 |
| Octal (base 8) | 37771 |
| Hexadecimal (base 16) | 3FF9 |
| Base 3 | 211110120 |
| As time | 16377 seconds = 4 h 32 min 57 s |
Is 16377 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 (16377 ÷ 3 = 5459) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16377 a prime number?
No. 16377 = 3 × 53 × 103, so it is divisible by 3.
What are the factors of 16377?
1, 3, 53, 103, 159, 309, 5459, 16377.
What is 16377 in binary?
11111111111001 (hexadecimal 3FF9, octal 37771).
What is the square root of 16377?
About 127.9727.
Is 16377 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 16377?
It is a composite number with 8 divisors.