Search a number
-
+
12210102012001 is a prime number
BaseRepresentation
bin1011000110101110001011…
…0010110000100001100001
31121020021102000002011120111
42301223202302300201201
53100022242103341001
641545124325211321
72400102465443365
oct261534262604141
947207360064514
1012210102012001
1139883032a6153
121452496560b41
136a753b89574a
14302d875b92a5
1516292d1a3851
hexb1ae2cb0861

12210102012001 has 2 divisors, whose sum is σ = 12210102012002. Its totient is φ = 12210102012000.

The previous prime is 12210102011969. The next prime is 12210102012037. The reversal of 12210102012001 is 10021020101221.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6753766637601 + 5456335374400 = 2598801^2 + 2335880^2 .

It is a cyclic number.

It is not a de Polignac number, because 12210102012001 - 25 = 12210102011969 is a prime.

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

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

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

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

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

Almost surely, 212210102012001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 12210102012001 its reverse (10021020101221), we get a palindrome (22231122113222).

The spelling of 12210102012001 in words is "twelve trillion, two hundred ten billion, one hundred two million, twelve thousand, one".