Search a number
-
+
11030303301100 = 2252110303033011
BaseRepresentation
bin1010000010000011000101…
…0011110101110111101100
31110001111010210122212120121
42200200301103311313230
52421210030121113400
635243130144254324
72215625125041046
oct240406123656754
943044123585517
1011030303301100
113572a1a721606
1212a18b63113a4
136201cb5a1655
142a1c25db2a96
15141dcbc4521a
hexa08314f5dec

11030303301100 has 18 divisors (see below), whose sum is σ = 23935758163604. Its totient is φ = 4412121320400.

The previous prime is 11030303301079. The next prime is 11030303301119. The reversal of 11030303301100 is 110330303011.

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

It is an unprimeable number.

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

Almost surely, 211030303301100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 11030303301100 its reverse (110330303011), we get a palindrome (11140633604111).

The spelling of 11030303301100 in words is "eleven trillion, thirty billion, three hundred three million, three hundred one thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 110303033011 220606066022 441212132044 551515165055 1103030330110 2206060660220 2757575825275 5515151650550 11030303301100