Search a number
-
+
20110200112001 is a prime number
BaseRepresentation
bin1001001001010010001010…
…10101011000001110000001
32122012111221102102020002102
410210221011111120032001
510113441142212041001
6110434255353000145
74143625335354146
oct444510525301601
978174842366072
1020110200112001
11645376276726a
1223095a93b3055
13b2b4cb0a6bbc
144d74a5c523cd
1524d1a480ae6b
hex124a45558381

20110200112001 has 2 divisors, whose sum is σ = 20110200112002. Its totient is φ = 20110200112000.

The previous prime is 20110200111997. The next prime is 20110200112003. The reversal of 20110200112001 is 10021100201102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 18051247752976 + 2058952359025 = 4248676^2 + 1434905^2 .

It is a cyclic number.

It is not a de Polignac number, because 20110200112001 - 22 = 20110200111997 is a prime.

Together with 20110200112003, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 220110200112001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 20110200112001 its reverse (10021100201102), we get a palindrome (30131300313103).

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