Search a number
-
+
100111110101311 is a prime number
BaseRepresentation
bin10110110000110011101111…
…001001111101100100111111
3111010110112021101120111101011
4112300303233021331210333
5101110210023141220221
6552530224205500051
730041534430336541
oct2660635711754477
9433415241514334
10100111110101311
1129997979840891
12b28a254271627
1343b258b61c51a
141aa1591603691
15b891be0961e1
hex5b0cef27d93f

100111110101311 has 2 divisors, whose sum is σ = 100111110101312. Its totient is φ = 100111110101310.

The previous prime is 100111110101297. The next prime is 100111110101323. The reversal of 100111110101311 is 113101011111001.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100111110101311 - 211 = 100111110099263 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (100111110107311) 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, 50055555050655 + 50055555050656.

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

Almost surely, 2100111110101311 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 13.

Adding to 100111110101311 its reverse (113101011111001), we get a palindrome (213212121212312).

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