Search a number
-
+
11020111110122 = 25510055555061
BaseRepresentation
bin1010000001011101000111…
…0011101101111111101010
31110000111211111020220222212
42200113101303231333222
52421023141421010442
635234322534245122
72215114424614412
oct240272163557752
943014744226885
1011020111110122
11356966a478684
12129b930ab67a2
1361c265b3240a
142a153a501642
151419d2071a82
hexa05d1cedfea

11020111110122 has 4 divisors (see below), whose sum is σ = 16530166665186. Its totient is φ = 5510055555060.

The previous prime is 11020111110037. The next prime is 11020111110131. The reversal of 11020111110122 is 22101111102011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 9859731880441 + 1160379229681 = 3140021^2 + 1077209^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2755027777529 + ... + 2755027777532.

Almost surely, 211020111110122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5510055555063.

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

Adding to 11020111110122 its reverse (22101111102011), we get a palindrome (33121222212133).

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

Divisors: 1 2 5510055555061 11020111110122