Search a number
-
+
11010100110100 = 22527131215799523
BaseRepresentation
bin1010000000110111110100…
…0110110010001100010100
31102222112222210210102200021
42200031331012302030110
52420342141112010400
635225545315554524
72214311354536420
oct240157506621424
942875883712607
1011010100110100
1135653a2530143
1212999b82bba44
1361b32ba93170
142a0c6ab17b80
151415e823e71a
hexa037d1b2314

11010100110100 has 144 divisors (see below), whose sum is σ = 29408150896768. Its totient is φ = 3484193564160.

The previous prime is 11010100110083. The next prime is 11010100110109. The reversal of 11010100110100 is 101100101011.

It is a happy number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010100110109) 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 47 ways as a sum of consecutive naturals, for example, 110578939 + ... + 110678461.

Almost surely, 211010100110100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11010100110100 its reverse (101100101011), we get a palindrome (11111200211111).

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

Divisors: 1 2 4 5 7 10 13 14 20 25 26 28 35 50 52 65 70 91 100 130 140 175 182 260 325 350 364 455 650 700 910 1300 1820 2275 4550 9100 12157 24314 48628 60785 85099 99523 121570 158041 170198 199046 243140 303925 316082 340396 398092 425495 497615 607850 632164 696661 790205 850990 995230 1106287 1215700 1293799 1393322 1580410 1701980 1990460 2127475 2212574 2488075 2587598 2786644 3160820 3483305 3951025 4254950 4425148 4976150 5175196 5531435 6468995 6966610 7902050 8509900 9056593 9952300 11062870 12937990 13933220 15804100 17416525 18113186 22125740 25875980 27657175 32344975 34833050 36226372 45282965 55314350 64689950 69666100 90565930 110628700 129379900 181131860 226414825 452829650 905659300 1209901111 2419802222 4839604444 6049505555 8469307777 12099011110 15728714443 16938615554 24198022220 30247527775 31457428886 33877231108 42346538885 60495055550 62914857772 78643572215 84693077770 110101001101 120990111100 157287144430 169386155540 211732694425 220202002202 314574288860 393217861075 423465388850 440404004404 550505005505 786435722150 846930777700 1101010011010 1572871444300 2202020022020 2752525027525 5505050055050 11010100110100