Search a number
-
+
102122010211021 is a prime number
BaseRepresentation
bin10111001110000100100010…
…001001000111001011001101
3111101120202202110220021212021
4113032010202021013023031
5101341131334103223041
61001110112010010141
730340033420263253
oct2716044211071315
9441522673807767
10102122010211021
112a5a27794a33a9
12b553b1a716951
1344ca0ab1a5648
141b30a359a05d3
15bc1663e80cd1
hex5ce1222472cd

102122010211021 has 2 divisors, whose sum is σ = 102122010211022. Its totient is φ = 102122010211020.

The previous prime is 102122010211007. The next prime is 102122010211027. The reversal of 102122010211021 is 120112010221201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67913899698121 + 34208110512900 = 8240989^2 + 5848770^2 .

It is a cyclic number.

It is not a de Polignac number, because 102122010211021 - 211 = 102122010208973 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 102122010210986 and 102122010211004.

It is a congruent number.

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

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

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

Almost surely, 2102122010211021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 102122010211021 its reverse (120112010221201), we get a palindrome (222234020432222).

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