Search a number
-
+
20110101103 is a prime number
BaseRepresentation
bin10010101110101001…
…111100101001101111
31220220111200222120101
4102232221330221233
5312141141213403
613123301131531
71311230016241
oct225651745157
956814628511
1020110101103
11858a69a674
123a929b9ba7
131b86447011
14d8ab86091
157ca76871d
hex4aea7ca6f

20110101103 has 2 divisors, whose sum is σ = 20110101104. Its totient is φ = 20110101102.

The previous prime is 20110101071. The next prime is 20110101113. The reversal of 20110101103 is 30110101102.

It is an a-pointer prime, because the next prime (20110101113) can be obtained adding 20110101103 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20110101103 - 25 = 20110101071 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 20110101103.

It is a congruent number.

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

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

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

Almost surely, 220110101103 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 20110101103 its reverse (30110101102), we get a palindrome (50220202205).

Subtracting 20110101103 from its reverse (30110101102), we obtain a palindrome (9999999999).

The spelling of 20110101103 in words is "twenty billion, one hundred ten million, one hundred one thousand, one hundred three".