Search a number
-
+
11011020022 = 25993313729
BaseRepresentation
bin10100100000100111…
…01101010011110110
31001102101011202212101
422100103231103312
5140022310120042
65020340212314
7536602061122
oct122023552366
931371152771
1011011020022
114740485352
12217369a09a
1310662b5582
1476653c582
15446a196b7
hex2904ed4f6

11011020022 has 8 divisors (see below), whose sum is σ = 16796471400. Its totient is φ = 5412196224.

The previous prime is 11011019959. The next prime is 11011020073. The reversal of 11011020022 is 22002011011.

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

It is a sphenic number, since it is the product of 3 distinct primes.

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

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, 46656747 + ... + 46656982.

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

Almost surely, 211011020022 is an apocalyptic number.

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

11011020022 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 93313790.

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

Adding to 11011020022 its reverse (22002011011), we get a palindrome (33013031033).

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

Divisors: 1 2 59 118 93313729 186627458 5505510011 11011020022