Search a number
-
+
11030320022 = 25515160011
BaseRepresentation
bin10100100010111010…
…10101001110010110
31001110201111022111012
422101131111032112
5140042230220042
65022310012222
7540225113261
oct122135251626
931421438435
1011030320022
114750367767
12217a047072
13106a2b21a7
14768d23cd8
1544857ce82
hex291755396

11030320022 has 4 divisors (see below), whose sum is σ = 16545480036. Its totient is φ = 5515160010.

The previous prime is 11030319997. The next prime is 11030320031. The reversal of 11030320022 is 22002303011.

It is a happy number.

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

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

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

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 as a sum of consecutive naturals, namely, 2757580004 + ... + 2757580007.

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

Almost surely, 211030320022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5515160013.

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

Adding to 11030320022 its reverse (22002303011), we get a palindrome (33032623033).

The spelling of 11030320022 in words is "eleven billion, thirty million, three hundred twenty thousand, twenty-two".

Divisors: 1 2 5515160011 11030320022