Search a number
-
+
10112100111 = 323748616247
BaseRepresentation
bin10010110101011101…
…00110011100001111
3222002201200220120100
421122232212130033
5131202144200421
64351225222143
7505405301301
oct113256463417
928081626510
1010112100111
11431a020533
121b62631953
13c51ca96b9
146bcdc3971
153e2b52c26
hex25aba670f

10112100111 has 24 divisors (see below), whose sum is σ = 15006621344. Its totient is φ = 6556800960.

The previous prime is 10112100071. The next prime is 10112100133. The reversal of 10112100111 is 11100121101.

It is not a de Polignac number, because 10112100111 - 210 = 10112099087 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10112100511) 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 in 23 ways as a sum of consecutive naturals, for example, 1615590 + ... + 1621836.

Almost surely, 210112100111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11151 (or 11148 counting only the distinct ones).

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

Adding to 10112100111 its reverse (11100121101), we get a palindrome (21212221212).

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

Divisors: 1 3 9 37 111 333 4861 6247 14583 18741 43749 56223 179857 231139 539571 693417 1618713 2080251 30366667 91100001 273300003 1123566679 3370700037 10112100111