Search a number
BaseRepresentation
bin1010000000111011111111…
…1011000100000011101110
31102222122212221011011211221
42200032333323010003232
52420401440101023042
635230252442533554
72214351216100606
oct240167773040356
942878787134757
1011011221111022
113565918289790
12129a06b8072ba
1361b47a0b7a12
142a0d35961c06
15141661872d67
hexa03bfec40ee

11011221111022 has 64 divisors (see below), whose sum is σ = 18304044595200. Its totient is φ = 4925999232000.

The previous prime is 11011221110987. The next prime is 11011221111041. The reversal of 11011221111022 is 22011112211011.

Adding to 11011221111022 its reverse (22011112211011), we get a palindrome (33022333322033).

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3474665854 + ... + 3474669022.

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

Almost surely, 211011221111022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6433.

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

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