Search a number
-
+
11020303100 = 2252110203031
BaseRepresentation
bin10100100001101110…
…00111101011111100
31001110000122101212002
422100313013223330
5140032144144400
65021311201432
7540044013362
oct122067075374
931400571762
1011020303100
114745745914
122176816278
1310681b5a11
14767877632
1544774eed5
hex290dc7afc

11020303100 has 18 divisors (see below), whose sum is σ = 23914057944. Its totient is φ = 4408121200.

The previous prime is 11020303087. The next prime is 11020303103. The reversal of 11020303100 is 130302011.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11020303103) by changing a digit.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55101416 + ... + 55101615.

Almost surely, 211020303100 is an apocalyptic number.

11020303100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

11020303100 is an abundant number, since it is smaller than the sum of its proper divisors (12893754844).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 110203045 (or 110203038 counting only the distinct ones).

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

Adding to 11020303100 its reverse (130302011), we get a palindrome (11150605111).

The spelling of 11020303100 in words is "eleven billion, twenty million, three hundred three thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 110203031 220406062 440812124 551015155 1102030310 2204060620 2755075775 5510151550 11020303100