Search a number
-
+
110100111100102 = 21013299165216749
BaseRepresentation
bin11001000010001010101110…
…000000110000100011000110
3112102211110122001020121001101
4121002022232000300203012
5103412340011420200402
61030055143124050314
732122320251031214
oct3102125600604306
9472743561217041
10110100111100102
1132099216459462
121042218053399a
13495851bb0cbb6
141d28c33a41cb4
15cade53595b87
hex6422ae0308c6

110100111100102 has 16 divisors (see below), whose sum is σ = 166835874150000. Its totient is φ = 54488483490400.

The previous prime is 110100111100081. The next prime is 110100111100141. The reversal of 110100111100102 is 201001111001011.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110100111100102 is an apocalyptic number.

110100111100102 is a deficient number, since it is larger than the sum of its proper divisors (56735763049898).

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

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

The sum of its prime factors is 165220151.

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 110100111100102 its reverse (201001111001011), we get a palindrome (311101222101113).

Subtracting 110100111100102 from its reverse (201001111001011), we obtain a palindrome (90900999900909).

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

Divisors: 1 2 101 202 3299 6598 333199 666398 165216749 330433498 16686891649 33373783298 545050054951 1090100109902 55050055550051 110100111100102