Search a number
-
+
11066302500 = 2235411314327
BaseRepresentation
bin10100100111001101…
…00110000000100100
31001120020012102011120
422103212212000210
5140130433140000
65030033133540
7541143006411
oct122346460044
931506172146
1011066302500
114769703950
12218a0ba2b0
1310748a01b6
1476da0d108
1544b7d96a0
hex2939a6024

11066302500 has 240 divisors, whose sum is σ = 36343566336. Its totient is φ = 2595600000.

The previous prime is 11066302477. The next prime is 11066302517. The reversal of 11066302500 is 520366011.

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2555337 + ... + 2559663.

Almost surely, 211066302500 is an apocalyptic number.

11066302500 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 11066302500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18171783168).

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

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

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 24.

Adding to 11066302500 its reverse (520366011), we get a palindrome (11586668511).

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