Base | Representation |
---|---|
bin | 11001000000110110111001… |
… | …000011010010101000111111 |
3 | 112102111212022011020120012022 |
4 | 121000312321003102220333 |
5 | 103404401142103001231 |
6 | 1025545535420430355 |
7 | 32112652611224261 |
oct | 3100667103225077 |
9 | 472455264216168 |
10 | 110010102000191 |
11 | 32064027692488 |
12 | 104088406a83bb |
13 | 494cba6152973 |
14 | 1d24735855b31 |
15 | cab93651cc7b |
hex | 640db90d2a3f |
110010102000191 has 2 divisors, whose sum is σ = 110010102000192. Its totient is φ = 110010102000190.
The previous prime is 110010102000187. The next prime is 110010102000193. The reversal of 110010102000191 is 191000201010011.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (191000201010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110010102000191 - 22 = 110010102000187 is a prime.
Together with 110010102000193, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110010102000193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005051000095 + 55005051000096.
It is an arithmetic number, because the mean of its divisors is an integer number (55005051000096).
Almost surely, 2110010102000191 is an apocalyptic number.
110010102000191 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010102000191 is an equidigital number, since it uses as much as digits as its factorization.
110010102000191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 110010102000191 in words is "one hundred ten trillion, ten billion, one hundred two million, one hundred ninety-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •