Search a number
-
+
102221200002121 is a prime number
BaseRepresentation
bin10111001111100000111010…
…010100001000110001001001
3111101221020210011222202102221
4113033200322110020301021
5101344243004200031441
61001223434311254041
730350144425505554
oct2717407224106111
9441836704882387
10102221200002121
112a630849555572
12b56b1a107a321
134506557b99525
141b3576519969b
15bc401bec88d1
hex5cf83a508c49

102221200002121 has 2 divisors, whose sum is σ = 102221200002122. Its totient is φ = 102221200002120.

The previous prime is 102221200002083. The next prime is 102221200002167. The reversal of 102221200002121 is 121200002122201.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100828006929225 + 1393193072896 = 10041315^2 + 1180336^2 .

It is a cyclic number.

It is not a de Polignac number, because 102221200002121 - 237 = 102083761048649 is a prime.

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

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

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

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

Almost surely, 2102221200002121 is an apocalyptic number.

It is an amenable number.

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

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

102221200002121 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 102221200002121 its reverse (121200002122201), we get a palindrome (223421202124322).

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