The number 19891
19891 is a palindromic prime: it reads the same backwards and is prime, a twin prime (19889 and 19891 are both prime) and the 2250th prime number. Its only divisors are 1 and 19891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19891: a palindromic prime: it reads the same backwards and is prime; a twin prime (19889 and 19891 are both prime); the 2250th prime number; a palindrome: it reads 19891 backwards too.
- 2
19891 is prime, so its only factors are 1 and 19891. It is the 2250th prime; the next prime is 19913 and the one before is 19889.
- 3
The divisors add up to 19892; without 19891 itself that is 1, so 19891 is deficient (1 is less than 19891). Euler's totient φ(19891) = 19890 numbers up to 19891 share no factor with it.
- 4
The digits of 19891 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
19891 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 19892 |
| Euler totient φ(n) | 19890 |
| Square | 395651881 |
| Cube | 7869911564971 |
| Square root | 141.035457 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9891 × |
19891 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and ninety-one |
| Binary (base 2) | 100110110110011 |
| Octal (base 8) | 46663 |
| Hexadecimal (base 16) | 4DB3 |
| Base 3 | 1000021201 |
| As time | 19891 seconds = 5 h 31 min 31 s |
Is 19891 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 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19891 a prime number?
Yes. 19891 is divisible only by 1 and itself.
What are the factors of 19891?
1, 19891.
What is 19891 in binary?
100110110110011 (hexadecimal 4DB3, octal 46663).
What is the square root of 19891?
About 141.0355.
Is 19891 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19891?
19891 is a palindromic prime: it reads the same backwards and is prime; a twin prime (19889 and 19891 are both prime); the 2250th prime number; a palindrome: it reads 19891 backwards too.