Search a number
-
+
2122121024321 is a prime number
BaseRepresentation
bin11110111000011000010…
…001010001001101000001
321111212120021002122211212
4132320120101101031001
5234232100440234241
64302520002215505
7306214065040604
oct36703021211501
97455507078755
102122121024321
11748a93aa3971
122a3346054595
13125165cbaccc
14749d579633b
153a30429ebeb
hex1ee18451341

2122121024321 has 2 divisors, whose sum is σ = 2122121024322. Its totient is φ = 2122121024320.

The previous prime is 2122121024291. The next prime is 2122121024327. The reversal of 2122121024321 is 1234201212212.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1533585024400 + 588535999921 = 1238380^2 + 767161^2 .

It is a cyclic number.

It is not a de Polignac number, because 2122121024321 - 234 = 2104941155137 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 22122121024321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 768, while the sum is 23.

Adding to 2122121024321 its reverse (1234201212212), we get a palindrome (3356322236533).

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