Search a number
-
+
21200000101141 is a prime number
BaseRepresentation
bin1001101001000000000100…
…11110011010101100010101
32210001200220110100202101011
410310200002132122230111
510234320100011214031
6113031051240532221
74315435523415541
oct464400236325425
983050813322334
1021200000101141
116833962413114
122464851181071
13baa1c7905794
1453412a7b0a21
1526b6d9a916b1
hex13480279ab15

21200000101141 has 2 divisors, whose sum is σ = 21200000101142. Its totient is φ = 21200000101140.

The previous prime is 21200000101139. The next prime is 21200000101213. The reversal of 21200000101141 is 14110100000212.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10781726870916 + 10418273230225 = 3283554^2 + 3227735^2 .

It is a cyclic number.

It is not a de Polignac number, because 21200000101141 - 21 = 21200000101139 is a prime.

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

It is a congruent number.

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

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

Almost surely, 221200000101141 is an apocalyptic number.

It is an amenable number.

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

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

21200000101141 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 21200000101141 its reverse (14110100000212), we get a palindrome (35310100101353).

The spelling of 21200000101141 in words is "twenty-one trillion, two hundred billion, one hundred one thousand, one hundred forty-one".