Search a number
-
+
102220100022121 is a prime number
BaseRepresentation
bin10111001111011111111000…
…110000000010111101101001
3111101221010221112011222112221
4113033133320300002331221
5101344233231101201441
61001223133215034041
730350105241025024
oct2717377060027551
9441833845158487
10102220100022121
112a630334654294
12b56ab3480b921
1345064110249a3
141b3569d0641bb
15bc3ea56488d1
hex5cf7f8c02f69

102220100022121 has 2 divisors, whose sum is σ = 102220100022122. Its totient is φ = 102220100022120.

The previous prime is 102220100022077. The next prime is 102220100022133. The reversal of 102220100022121 is 121220001022201.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53870829105625 + 48349270916496 = 7339675^2 + 6953364^2 .

It is a cyclic number.

It is not a de Polignac number, because 102220100022121 - 27 = 102220100021993 is a prime.

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

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

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

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

Almost surely, 2102220100022121 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 102220100022121 its reverse (121220001022201), we get a palindrome (223440101044322).

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