Search a number
-
+
110110101111053 is a prime number
BaseRepresentation
bin11001000010010100000001…
…011101101000000100001101
3112102212102102021012201202222
4121002110001131220010031
5103413020441341023203
61030103514312425125
732123122644520451
oct3102240135500415
9472772367181688
10110110101111053
11320a248257055a
12104240aa0a81a5
134959451710794
141d29500724661
15cae33a62e038
hex64250176810d

110110101111053 has 2 divisors, whose sum is σ = 110110101111054. Its totient is φ = 110110101111052.

The previous prime is 110110101110993. The next prime is 110110101111083. The reversal of 110110101111053 is 350111101011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109667873451049 + 442227660004 = 10472243^2 + 665002^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110101111053 - 220 = 110110100062477 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2110110101111053 is an apocalyptic number.

It is an amenable number.

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

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

110110101111053 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 17.

Adding to 110110101111053 its reverse (350111101011011), we get a palindrome (460221202122064).

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