Search a number
-
+
100111110111011 is a prime number
BaseRepresentation
bin10110110000110011101111…
…001001111111111100100011
3111010110112021101120222200102
4112300303233021333330203
5101110210023142023021
6552530224210013015
730041534430410036
oct2660635711777443
9433415241528612
10100111110111011
11299979798480aa
12b28a25427716b
1343b258b623a6c
141aa159160701d
15b891be09900b
hex5b0cef27ff23

100111110111011 has 2 divisors, whose sum is σ = 100111110111012. Its totient is φ = 100111110111010.

The previous prime is 100111110110983. The next prime is 100111110111013. The reversal of 100111110111011 is 110111011111001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100111110111011 - 214 = 100111110094627 is a prime.

Together with 100111110111013, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 100111110110983 and 100111110111001.

It is not a weakly prime, because it can be changed into another prime (100111110111013) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055555055505 + 50055555055506.

It is an arithmetic number, because the mean of its divisors is an integer number (50055555055506).

Almost surely, 2100111110111011 is an apocalyptic number.

100111110111011 is a deficient number, since it is larger than the sum of its proper divisors (1).

100111110111011 is an equidigital number, since it uses as much as digits as its factorization.

100111110111011 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1, while the sum is 11.

Adding to 100111110111011 its reverse (110111011111001), we get a palindrome (210222121222012).

The spelling of 100111110111011 in words is "one hundred trillion, one hundred eleven billion, one hundred ten million, one hundred eleven thousand, eleven".