Search a number
-
+
110010211121989 is a prime number
BaseRepresentation
bin11001000000110110111111…
…100011100011101101000101
3112102111212120202120112011101
4121000312333203203231011
5103404401403021400424
61025545554315340101
732112655404600523
oct3100667743435505
9472455522515141
10110010211121989
1132064083244292
1210408871151631
13494cbc293b389
141d2474613d313
15cab940dc5344
hex640dbf8e3b45

110010211121989 has 2 divisors, whose sum is σ = 110010211121990. Its totient is φ = 110010211121988.

The previous prime is 110010211121929. The next prime is 110010211122011. The reversal of 110010211121989 is 989121112010011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63821197059489 + 46189014062500 = 7988817^2 + 6796250^2 .

It is a cyclic number.

It is not a de Polignac number, because 110010211121989 - 235 = 109975851383621 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2110010211121989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 37.

The spelling of 110010211121989 in words is "one hundred ten trillion, ten billion, two hundred eleven million, one hundred twenty-one thousand, nine hundred eighty-nine".