Search a number
-
+
11100000110102 = 210723111558709
BaseRepresentation
bin1010000110000110101110…
…0100000100011000010110
31110022011001002111121120222
42201201223210010120112
52423330300012010402
635335134124554342
72223643231120661
oct241415344043026
943264032447528
1011100000110102
11359a53575a802
1212b33076b29b2
13626957c71937
142a53586246d8
15143b0a9167a2
hexa186b904616

11100000110102 has 24 divisors (see below), whose sum is σ = 16861114735920. Its totient is φ = 5480448502160.

The previous prime is 11100000110047. The next prime is 11100000110119. The reversal of 11100000110102 is 20101100000111.

It is a happy number.

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

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

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

Almost surely, 211100000110102 is an apocalyptic number.

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

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

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

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

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

Adding to 11100000110102 its reverse (20101100000111), we get a palindrome (31201100110213).

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

Divisors: 1 2 107 214 311 622 11449 22898 33277 66554 1558709 3117418 3560639 7121278 166781863 333563726 484758499 969516998 17845659341 35691318682 51869159393 103738318786 5550000055051 11100000110102