Search a number
-
+
20100110011 = 7110917315013
BaseRepresentation
bin10010101110000011…
…110101011010111011
31220212210220101100221
4102232003311122323
5312131112010021
613122303040511
71311046054552
oct225603653273
956783811327
1020100110011
118584a96173
123a8b5a0137
131b84359527
14d89704d99
157c9943241
hex4ae0f56bb

20100110011 has 16 divisors (see below), whose sum is σ = 20690493120. Its totient is φ = 19520403840.

The previous prime is 20100109993. The next prime is 20100110033. The reversal of 20100110011 is 11001100102.

It is a cyclic number.

It is not a de Polignac number, because 20100110011 - 233 = 11510175419 is a prime.

It is a Duffinian number.

20100110011 is a modest number, since divided by 110011 gives 201 as remainder.

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

It is not an unprimeable number, because it can be changed into a prime (20100110311) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1331341 + ... + 1346353.

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

Almost surely, 220100110011 is an apocalyptic number.

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

20100110011 is a wasteful number, since it uses less digits than its factorization.

20100110011 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 15366.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 20100110011 its reverse (11001100102), we get a palindrome (31101210113).

Subtracting from 20100110011 its reverse (11001100102), we obtain a palindrome (9099009909).

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

Divisors: 1 71 109 173 7739 12283 15013 18857 1065923 1338847 1636417 2597249 116185607 184404679 283100141 20100110011