Search a number
-
+
20102131111 is a prime number
BaseRepresentation
bin10010101110001011…
…100010110110100111
31220212221201001210111
4102232023202312213
5312132121143421
613122414233451
71311102203146
oct225613426647
956787631714
1020102131111
1185861466a7
123a901b5887
131b848b644a
14d89aad75d
157c9be1ee1
hex4ae2e2da7

20102131111 has 2 divisors, whose sum is σ = 20102131112. Its totient is φ = 20102131110.

The previous prime is 20102131003. The next prime is 20102131183. The reversal of 20102131111 is 11113120102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20102131111 - 213 = 20102122919 is a prime.

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

It is a congruent number.

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

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

Almost surely, 220102131111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 20102131111 its reverse (11113120102), we get a palindrome (31215251213).

The spelling of 20102131111 in words is "twenty billion, one hundred two million, one hundred thirty-one thousand, one hundred eleven".