Search a number
-
+
2002002121981 is a prime number
BaseRepresentation
bin11101001000100000101…
…000000001010011111101
321002101111222012012000001
4131020200220001103331
5230300100020400411
64131412421234301
7264432323155261
oct35104050012375
97071458165001
102002002121981
11702054007754
12284002562991
13116a322a2534
146cc7c73c0a1
1537123b5ddc1
hex1d220a014fd

2002002121981 has 2 divisors, whose sum is σ = 2002002121982. Its totient is φ = 2002002121980.

The previous prime is 2002002121967. The next prime is 2002002122023. The reversal of 2002002121981 is 1891212002002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1523817424900 + 478184697081 = 1234430^2 + 691509^2 .

It is a cyclic number.

It is not a de Polignac number, because 2002002121981 - 27 = 2002002121853 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2002002121921) 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, 1001001060990 + 1001001060991.

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

Almost surely, 22002002121981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1152, while the sum is 28.

Adding to 2002002121981 its reverse (1891212002002), we get a palindrome (3893214123983).

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