Search a number
-
+
212302330021321 is a prime number
BaseRepresentation
bin110000010001011001111100…
…111101110100010111001001
31000211200220102101222112110221
4300101121330331310113021
5210311330132441140241
62031310202145110041
762501223436161601
oct6021317475642711
91024626371875427
10212302330021321
1161711a0464aa01
121b989744928321
1391600404340b7
143a5d6b7d89c01
15198270dec05d1
hexc1167cf745c9

212302330021321 has 2 divisors, whose sum is σ = 212302330021322. Its totient is φ = 212302330021320.

The previous prime is 212302330021289. The next prime is 212302330021339. The reversal of 212302330021321 is 123120033203212.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 127113786525625 + 85188543495696 = 11274475^2 + 9229764^2 .

It is a cyclic number.

It is not a de Polignac number, because 212302330021321 - 25 = 212302330021289 is a prime.

It is a super-3 number, since 3×2123023300213213 (a number of 44 digits) contains 333 as substring.

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

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

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

Almost surely, 2212302330021321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 25.

Adding to 212302330021321 its reverse (123120033203212), we get a palindrome (335422363224533).

The spelling of 212302330021321 in words is "two hundred twelve trillion, three hundred two billion, three hundred thirty million, twenty-one thousand, three hundred twenty-one".