The number 16361
16361 is a palindromic prime: it reads the same backwards and is prime, a twin prime (16361 and 16363 are both prime) and the 1897th prime number. Its only divisors are 1 and 16361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16361: a palindromic prime: it reads the same backwards and is prime; a twin prime (16361 and 16363 are both prime); the 1897th prime number; a palindrome: it reads 16361 backwards too.
- 2
16361 is prime, so its only factors are 1 and 16361. It is the 1897th prime; the next prime is 16363 and the one before is 16349.
- 3
The divisors add up to 16362; without 16361 itself that is 1, so 16361 is deficient (1 is less than 16361). Euler's totient φ(16361) = 16360 numbers up to 16361 share no factor with it.
- 4
The digits of 16361 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 159 steps to reach 1.
16361 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 16362 |
| Euler totient φ(n) | 16360 |
| Square | 267682321 |
| Cube | 4379550453881 |
| Square root | 127.910125 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.6361 × |
16361 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and sixty-one |
| Binary (base 2) | 11111111101001 |
| Octal (base 8) | 37751 |
| Hexadecimal (base 16) | 3FE9 |
| Base 3 | 211102222 |
| As time | 16361 seconds = 4 h 32 min 41 s |
Is 16361 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 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 8) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16361 a prime number?
Yes. 16361 is divisible only by 1 and itself.
What are the factors of 16361?
1, 16361.
What is 16361 in binary?
11111111101001 (hexadecimal 3FE9, octal 37751).
What is the square root of 16361?
About 127.9101.
Is 16361 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 16361?
16361 is a palindromic prime: it reads the same backwards and is prime; a twin prime (16361 and 16363 are both prime); the 1897th prime number; a palindrome: it reads 16361 backwards too.