Search a number
-
+
101111000000011 is a prime number
BaseRepresentation
bin10110111111010110111101…
…001111001110011000001011
3111021000010011102211012021021
4112333112331033032120023
5101223100312000000021
6555013430244253311
730204012560262541
oct2677267517163013
9437003142735237
10101111000000011
112a242a305a5a71
12b40bba53a1237
134455959b48861
141ad7b27189d91
15ba51e0d0ec41
hex5bf5bd3ce60b

101111000000011 has 2 divisors, whose sum is σ = 101111000000012. Its totient is φ = 101111000000010.

The previous prime is 101110999999957. The next prime is 101111000000033. The reversal of 101111000000011 is 110000000111101.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101111000000011 - 27 = 101110999999883 is a prime.

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

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

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

Almost surely, 2101111000000011 is an apocalyptic number.

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

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

101111000000011 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 7.

Adding to 101111000000011 its reverse (110000000111101), we get a palindrome (211111000111112).

The spelling of 101111000000011 in words is "one hundred one trillion, one hundred eleven billion, eleven", and thus it is an aban number.