Search a number
-
+
110001110010100 = 22525374572783281
BaseRepresentation
bin11001000000101110100001…
…000101100100100011110100
3112102111000002111020010201021
4121000232201011210203310
5103404224233130310400
61025541451243110524
732112214023453601
oct3100564105444364
9472430074203637
10110001110010100
1132060232972211
1210406b51212444
13494c0a224847a
141d241215276a8
15cab5abdc471a
hex640ba11648f4

110001110010100 has 72 divisors (see below), whose sum is σ = 243238929634008. Its totient is φ = 43164442214400.

The previous prime is 110001110010079. The next prime is 110001110010157. The reversal of 110001110010100 is 1010011100011.

It is a happy number.

It can be written as a sum of positive squares in 12 ways, for example, as 67233538555236 + 42767571454864 = 8199606^2 + 6539692^2 .

It is a congruent number.

It is an unprimeable number.

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 23 ways as a sum of consecutive naturals, for example, 38130460 + ... + 40913740.

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

Almost surely, 2110001110010100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110001110010100 its reverse (1010011100011), we get a palindrome (111011121110111).

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

Divisors: 1 2 4 5 10 20 25 50 53 100 106 212 265 530 1060 1325 2650 5300 7457 14914 29828 37285 74570 149140 186425 372850 395221 745700 790442 1580884 1976105 2783281 3952210 5566562 7904420 9880525 11133124 13916405 19761050 27832810 39522100 55665620 69582025 139164050 147513893 278328100 295027786 590055572 737569465 1475138930 2950277860 3687847325 7375694650 14751389300 20754926417 41509852834 83019705668 103774632085 207549264170 415098528340 518873160425 1037746320850 1100011100101 2075492641700 2200022200202 4400044400404 5500055500505 11000111001010 22000222002020 27500277502525 55000555005050 110001110010100