Search a number
-
+
101111011093 is a prime number
BaseRepresentation
bin101111000101010101…
…1111001011100010101
3100122222121012112221201
41132022223321130111
53124033404323333
6114241051512501
710206424261621
oct1361253713425
9318877175851
10101111011093
1139976591194
1217719a58731
1396c4a47261
144c72828181
15296ba4817d
hex178aaf9715

101111011093 has 2 divisors, whose sum is σ = 101111011094. Its totient is φ = 101111011092.

The previous prime is 101111011063. The next prime is 101111011121. The reversal of 101111011093 is 390110111101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100388852964 + 722158129 = 316842^2 + 26873^2 .

It is an emirp because it is prime and its reverse (390110111101) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101111011093 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101111011093.

It is a congruent number.

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

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

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

Almost surely, 2101111011093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 19.

Adding to 101111011093 its reverse (390110111101), we get a palindrome (491221122194).

The spelling of 101111011093 in words is "one hundred one billion, one hundred eleven million, eleven thousand, ninety-three".