Search a number
-
+
20102211013 is a prime number
BaseRepresentation
bin10010101110001011…
…110110010111000101
31220212221212010101211
4102232023312113011
5312132131223023
613122420051421
71311102655123
oct225613662705
956787763354
1020102211013
1185861a0735
123a90233b71
131b84913921
14d89ad0913
157c9c0aa0d
hex4ae2f65c5

20102211013 has 2 divisors, whose sum is σ = 20102211014. Its totient is φ = 20102211012.

The previous prime is 20102211001. The next prime is 20102211079. The reversal of 20102211013 is 31011220102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20100717729 + 1493284 = 141777^2 + 1222^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-20102211013 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 220102211013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 20102211013 its reverse (31011220102), we get a palindrome (51113431115).

The spelling of 20102211013 in words is "twenty billion, one hundred two million, two hundred eleven thousand, thirteen".