Search a number
-
+
11022011101022 = 25511005550511
BaseRepresentation
bin1010000001100100001100…
…0011100110111101011110
31110000200201220102110112012
42200121003003212331132
52421041034320213042
635235235245511222
72215212465355445
oct240310303467536
943020656373465
1011022011101022
11356a454a17999
1212a0181272512
1361c4a9661a9c
142a167a9a5d5c
15141a93c7be82
hexa06430e6f5e

11022011101022 has 4 divisors (see below), whose sum is σ = 16533016651536. Its totient is φ = 5511005550510.

The previous prime is 11022011100977. The next prime is 11022011101063. The reversal of 11022011101022 is 22010111022011.

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

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 211022011101022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5511005550513.

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

Adding to 11022011101022 its reverse (22010111022011), we get a palindrome (33032122123033).

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

Divisors: 1 2 5511005550511 11022011101022