Search a number
-
+
11052662500 = 225511312593
BaseRepresentation
bin10100100101100101…
…00011111011100100
31001112021112102121101
422102302203323210
5140113440200000
65024424525444
7540616036555
oct122262437344
931467472541
1011052662500
114761a37a20
122185620884
131071b058a9
1476bc9c32c
1544a4e2e6a
hex292ca3ee4

11052662500 has 144 divisors (see below), whose sum is σ = 27235256832. Its totient is φ = 3888000000.

The previous prime is 11052662479. The next prime is 11052662503. The reversal of 11052662500 is 526625011.

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

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

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

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 in 47 ways as a sum of consecutive naturals, for example, 4261204 + ... + 4263796.

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

Almost surely, 211052662500 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11052662500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13617628416).

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

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

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 28.

It can be divided in two parts, 1 and 1052662500, that added together give a palindrome (1052662501).

The spelling of 11052662500 in words is "eleven billion, fifty-two million, six hundred sixty-two thousand, five hundred".

Divisors: 1 2 4 5 10 11 20 22 25 31 44 50 55 62 100 110 124 125 155 220 250 275 310 341 500 550 620 625 682 775 1100 1250 1364 1375 1550 1705 2500 2593 2750 3100 3125 3410 3875 5186 5500 6250 6820 6875 7750 8525 10372 12500 12965 13750 15500 17050 19375 25930 27500 28523 34100 34375 38750 42625 51860 57046 64825 68750 77500 80383 85250 96875 114092 129650 137500 142615 160766 170500 193750 213125 259300 285230 321532 324125 387500 401915 426250 570460 648250 713075 803830 852500 884213 1065625 1296500 1426150 1607660 1620625 1768426 2009575 2131250 2852300 3241250 3536852 3565375 4019150 4262500 4421065 6482500 7130750 8038300 8103125 8842130 10047875 14261500 16206250 17684260 17826875 20095750 22105325 32412500 35653750 40191500 44210650 50239375 71307500 88421300 89134375 100478750 110526625 178268750 200957500 221053250 251196875 356537500 442106500 502393750 552633125 1004787500 1105266250 2210532500 2763165625 5526331250 11052662500