Search a number
-
+
11103013101 = 343313727437
BaseRepresentation
bin10100101011100101…
…01000100011101101
31001122210021111122110
422111302220203231
5140214332404401
65033424034233
7542100024405
oct122562504355
931583244573
1011103013101
1147883a8094
12219a462979
13107c38474b
14774847805
1544eb3b9d6
hex295ca88ed

11103013101 has 16 divisors (see below), whose sum is σ = 15153678144. Its totient is φ = 7227300864.

The previous prime is 11103013091. The next prime is 11103013121. The reversal of 11103013101 is 10131030111.

11103013101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11103013101 - 218 = 11102750957 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 211103013101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30620.

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

Adding to 11103013101 its reverse (10131030111), we get a palindrome (21234043212).

The spelling of 11103013101 in words is "eleven billion, one hundred three million, thirteen thousand, one hundred one".

Divisors: 1 3 43 129 3137 9411 27437 82311 134891 404673 1179791 3539373 86069869 258209607 3701004367 11103013101