Search a number
-
+
111100102011 = 3340110261393
BaseRepresentation
bin110011101111000010…
…1010000010101111011
3101121202202102221122000
41213132011100111323
53310013111231021
6123012204432043
711012110166643
oct1473605202573
9347682387560
10111100102011
1143132125028
1219647248623
13a6273b5142
14553d34b523
152d5399db26
hex19de15057b

111100102011 has 16 divisors (see below), whose sum is σ = 165003215520. Its totient is φ = 73882022400.

The previous prime is 111100102007. The next prime is 111100102013. The reversal of 111100102011 is 110201001111.

It is not a de Polignac number, because 111100102011 - 22 = 111100102007 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (111100102013) 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, 5119870 + ... + 5141523.

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

Almost surely, 2111100102011 is an apocalyptic number.

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

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

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

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

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

Adding to 111100102011 its reverse (110201001111), we get a palindrome (221301103122).

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

Divisors: 1 3 9 27 401 1203 3609 10827 10261393 30784179 92352537 277057611 4114818593 12344455779 37033367337 111100102011