Search a number
-
+
11010111110000 = 24546131179581
BaseRepresentation
bin1010000000110111110111…
…0000101111101101110000
31102222120000120111021200222
42200031331300233231300
52420342201421010000
635225550351432212
72214311550202202
oct240157560575560
942876016437628
1011010111110000
1135653a8763572
1212999bbb25668
1361b331144b92
142a0c6c37c772
151415e91b3a85
hexa037dc2fb70

11010111110000 has 100 divisors (see below), whose sum is σ = 26661076305864. Its totient is φ = 4403301600000.

The previous prime is 11010111109979. The next prime is 11010111110021. The reversal of 11010111110000 is 1111101011.

It is an interprime number because it is at equal distance from previous prime (11010111109979) and next prime (11010111110021).

It is a tau number, because it is divible by the number of its divisors (100).

It is a Harshad number since it is a multiple of its sum of digits (8).

It is a self number, because there is not a number n which added to its sum of digits gives 11010111110000.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 61220210 + ... + 61399790.

Almost surely, 211010111110000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 11010111110000 its reverse (1111101011), we get a palindrome (11011222211011).

The spelling of 11010111110000 in words is "eleven trillion, ten billion, one hundred eleven million, one hundred ten thousand".

Divisors: 1 2 4 5 8 10 16 20 25 40 50 80 100 125 200 250 400 500 625 1000 1250 2000 2500 5000 6131 10000 12262 24524 30655 49048 61310 98096 122620 153275 179581 245240 306550 359162 490480 613100 718324 766375 897905 1226200 1436648 1532750 1795810 2452400 2873296 3065500 3591620 3831875 4489525 6131000 7183240 7663750 8979050 12262000 14366480 15327500 17958100 22447625 30655000 35916200 44895250 61310000 71832400 89790500 112238125 179581000 224476250 359162000 448952500 897905000 1101011111 1795810000 2202022222 4404044444 5505055555 8808088888 11010111110 17616177776 22020222220 27525277775 44040444440 55050555550 88080888880 110101111100 137626388875 220202222200 275252777750 440404444400 550505555500 688131944375 1101011111000 1376263888750 2202022222000 2752527777500 5505055555000 11010111110000