Search a number
-
+
20111101110227 is a prime number
BaseRepresentation
bin1001001001010011110110…
…00010011010011111010011
32122012121021012210200022002
410210221323002122133103
510114000013341011402
6110434525020304215
74143656555621141
oct444517302323723
978177235720262
1020111101110227
1164540853105a6
1223097bb0a206b
13b2b61295ca4a
144d754d78c591
1524d208983602
hex124a7b09a7d3

20111101110227 has 2 divisors, whose sum is σ = 20111101110228. Its totient is φ = 20111101110226.

The previous prime is 20111101110209. The next prime is 20111101110239. The reversal of 20111101110227 is 72201110111102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20111101110227 - 28 = 20111101109971 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 20111101110199 and 20111101110208.

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

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

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

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

Almost surely, 220111101110227 is an apocalyptic number.

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

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

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

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

Adding to 20111101110227 its reverse (72201110111102), we get a palindrome (92312211221329).

The spelling of 20111101110227 in words is "twenty trillion, one hundred eleven billion, one hundred one million, one hundred ten thousand, two hundred twenty-seven".