Search a number
-
+
11020021122 = 2311166970017
BaseRepresentation
bin10100100001101100…
…00010110110000010
31001110000010002001110
422100312002312002
5140032111133442
65021301144150
7540041430315
oct122066026602
931400102043
1011020021122
114745572a80
1221766bb056
131068117576
1476780297c
154476e669c
hex290d82d82

11020021122 has 16 divisors (see below), whose sum is σ = 24043682592. Its totient is φ = 3339400320.

The previous prime is 11020021043. The next prime is 11020021193. The reversal of 11020021122 is 22112002011.

It is a super-2 number, since 2×110200211222 (a number of 21 digits) contains 22 as substring.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83484943 + ... + 83485074.

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

Almost surely, 211020021122 is an apocalyptic number.

11020021122 is an abundant number, since it is smaller than the sum of its proper divisors (13023661470).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 166970033.

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

Adding to 11020021122 its reverse (22112002011), we get a palindrome (33132023133).

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

Divisors: 1 2 3 6 11 22 33 66 166970017 333940034 500910051 1001820102 1836670187 3673340374 5510010561 11020021122