The number 16367
16367 is a composite number with 4 divisors. Its prime factorisation is 13 × 1259. Divisors (4): 1, 13, 1259, 16367.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16367: a semiprime: 13 × 1259, the product of two primes.
- 2
16367 is composite. Its prime factorisation is
- 3
The divisors add up to 17640; without 16367 itself that is 1273, so 16367 is deficient (1273 is less than 16367). Euler's totient φ(16367) = 15096 numbers up to 16367 share no factor with it.
- 4
The digits of 16367 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16367 = 13 \times 1259 \]
16367 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17640 |
| Euler totient φ(n) | 15096 |
| Square | 267878689 |
| Cube | 4384370502863 |
| Square root | 127.933577 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 190 |
| Scientific notation | 1.6367 × |
16367 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and sixty-seven |
| Binary (base 2) | 11111111101111 |
| Octal (base 8) | 37757 |
| Hexadecimal (base 16) | 3FEF |
| Base 3 | 211110012 |
| As time | 16367 seconds = 4 h 32 min 47 s |
Is 16367 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 | No (remainder 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16367 a prime number?
No. 16367 = 13 × 1259, so it is divisible by 13.
What are the factors of 16367?
1, 13, 1259, 16367.
What is 16367 in binary?
11111111101111 (hexadecimal 3FEF, octal 37757).
What is the square root of 16367?
About 127.9336.
Is 16367 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 16367?
16367 is a semiprime: 13 × 1259, the product of two primes.