Search a number
-
+
11021102012 = 2214551189353
BaseRepresentation
bin10100100001110100…
…01010101110111100
31001110002010222202102
422100322022232330
5140032400231022
65021340244232
7540053551514
oct122072125674
931402128672
1011021102012
114746141078
122176b40678
13106840554b
14767a04844
1544785ba92
hex290e8abbc

11021102012 has 12 divisors (see below), whose sum is σ = 19288355856. Its totient is φ = 5510143200.

The previous prime is 11021102003. The next prime is 11021102033. The reversal of 11021102012 is 21020112011.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 36473 + ... + 152880.

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

Almost surely, 211021102012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 11021102012 its reverse (21020112011), we get a palindrome (32041214023).

Subtracting 11021102012 from its reverse (21020112011), we obtain a palindrome (9999009999).

The spelling of 11021102012 in words is "eleven billion, twenty-one million, one hundred two thousand, twelve".

Divisors: 1 2 4 14551 29102 58204 189353 378706 757412 2755275503 5510551006 11021102012