Search a number
-
+
201101100111209 is a prime number
BaseRepresentation
bin101101101110011001111111…
…101000101101010101101001
3222101001002002102202021011202
4231232121333220231111221
5202324320023112024314
61551412323042133545
760234034505660414
oct5556317750552551
9871032072667152
10201101100111209
1159093552355161
121a67a8a76512b5
1388299a1c5661c
1437934b9258b7b
15183b17b3e90de
hexb6e67fa2d569

201101100111209 has 2 divisors, whose sum is σ = 201101100111210. Its totient is φ = 201101100111208.

The previous prime is 201101100111199. The next prime is 201101100111259. The reversal of 201101100111209 is 902111001101102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 199115466845584 + 1985633265625 = 14110828^2 + 1409125^2 .

It is a cyclic number.

It is not a de Polignac number, because 201101100111209 - 216 = 201101100045673 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2201101100111209 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 20.

The spelling of 201101100111209 in words is "two hundred one trillion, one hundred one billion, one hundred million, one hundred eleven thousand, two hundred nine".