Search a number
-
+
121020122120101 is a prime number
BaseRepresentation
bin11011100001000100110001…
…011000111011111110100101
3120212111102002101112001221221
4123201010301120323332211
5111330243202230320401
61105215513202140341
734330262305141321
oct3341046130737645
9525442071461857
10121020122120101
1135619388a48826
12116a66160516b1
13526b1c148a049
1421c5595aaa981
15ded02770b7a1
hex6e113163bfa5

121020122120101 has 2 divisors, whose sum is σ = 121020122120102. Its totient is φ = 121020122120100.

The previous prime is 121020122120021. The next prime is 121020122120143. The reversal of 121020122120101 is 101021221020121.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112804154064900 + 8215968055201 = 10620930^2 + 2866351^2 .

It is an emirp because it is prime and its reverse (101021221020121) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 121020122120101 - 27 = 121020122119973 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2121020122120101 is an apocalyptic number.

It is an amenable number.

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

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

121020122120101 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 121020122120101 its reverse (101021221020121), we get a palindrome (222041343140222).

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