Search a number
-
+
110110211257 is a prime number
BaseRepresentation
bin110011010001100010…
…1000111110010111001
3101112012202210021210111
41212203011013302321
53301001203230012
6122330043544321
710645430232034
oct1464305076271
9345182707714
10110110211257
11427743864a2
121940b82b0a1
13a4ca2a7477
145487ab201b
152ce6b17ba7
hex19a3147cb9

110110211257 has 2 divisors, whose sum is σ = 110110211258. Its totient is φ = 110110211256.

The previous prime is 110110211179. The next prime is 110110211303. The reversal of 110110211257 is 752112011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105669854761 + 4440356496 = 325069^2 + 66636^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110211257 - 219 = 110109686969 is a prime.

It is a super-2 number, since 2×1101102112572 (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2110110211257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 140, while the sum is 22.

Adding to 110110211257 its reverse (752112011011), we get a palindrome (862222222268).

The spelling of 110110211257 in words is "one hundred ten billion, one hundred ten million, two hundred eleven thousand, two hundred fifty-seven".