Search a number
-
+
21101014111 is a prime number
BaseRepresentation
bin10011101001101101…
…111110110001011111
32000110120021120200011
4103221231332301133
5321203324422421
613405455544051
71344621442402
oct235155766137
960416246604
1021101014111
118a48a77241
12410a82b027
131cb3822088
141042609d39
158377524e1
hex4e9b7ec5f

21101014111 has 2 divisors, whose sum is σ = 21101014112. Its totient is φ = 21101014110.

The previous prime is 21101014097. The next prime is 21101014127. The reversal of 21101014111 is 11141010112.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 21101014111 - 217 = 21100883039 is a prime.

It is a super-2 number, since 2×211010141112 (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 221101014111 is an apocalyptic number.

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

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

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

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

Adding to 21101014111 its reverse (11141010112), we get a palindrome (32242024223).

The spelling of 21101014111 in words is "twenty-one billion, one hundred one million, fourteen thousand, one hundred eleven".