Search a number
-
+
101111010101053 is a prime number
BaseRepresentation
bin10110111111010110111101…
…110101110000011100111101
3111021000010012010211101021221
4112333112331311300130331
5101223100322041213203
6555013431244553341
730204013042162621
oct2677267565603475
9437003163741257
10101111010101053
112a242a36275037
12b40bba8852851
13445595bc743c4
141ad7b28659181
15ba51e1b57abd
hex5bf5bdd7073d

101111010101053 has 2 divisors, whose sum is σ = 101111010101054. Its totient is φ = 101111010101052.

The previous prime is 101111010100987. The next prime is 101111010101063. The reversal of 101111010101053 is 350101010111101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 95522220961209 + 5588789139844 = 9773547^2 + 2364062^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101111010101053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 16.

Adding to 101111010101053 its reverse (350101010111101), we get a palindrome (451212020212154).

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