Search a number
-
+
10110111102102 = 2311153183501547
BaseRepresentation
bin1001001100011111000110…
…0101001011010010010110
31022210111222000200210122010
42103013301211023102112
52311121001420231402
633300304304045050
72062300656306504
oct223076145132226
938714860623563
1010110111102102
113248746168850
1211734a7903786
135844c16852cb
1426d490d93674
15127ec1b84a6c
hex931f194b496

10110111102102 has 16 divisors (see below), whose sum is σ = 22058424222912. Its totient is φ = 3063670030920.

The previous prime is 10110111102097. The next prime is 10110111102131. The reversal of 10110111102102 is 20120111101101.

It is a super-2 number, since 2×101101111021022 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76591750708 + ... + 76591750839.

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

Almost surely, 210110111102102 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 153183501563.

The product of its (nonzero) digits is 4, while the sum is 12.

Adding to 10110111102102 its reverse (20120111101101), we get a palindrome (30230222203203).

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

Divisors: 1 2 3 6 11 22 33 66 153183501547 306367003094 459550504641 919101009282 1685018517017 3370037034034 5055055551051 10110111102102