Search a number
-
+
102001112011112 = 2359216104050871
BaseRepresentation
bin10111001100010011111100…
…000011000101000101101000
3111101011012200212121101201112
4113030103330003011011220
5101332141234133323422
61000534355230005452
730325223433450236
oct2714237403050550
9441135625541645
10102001112011112
112a556479626406
12b5345ba046888
1344bb881ba5052
141b28c47249956
15bbd43a206ee2
hex5cc4fc0c5168

102001112011112 has 16 divisors (see below), whose sum is σ = 194493645784800. Its totient is φ = 50136139801840.

The previous prime is 102001112011103. The next prime is 102001112011129. The reversal of 102001112011112 is 211110211100201.

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

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108052024964 + ... + 108052025907.

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

Almost surely, 2102001112011112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 102001112011112 its reverse (211110211100201), we get a palindrome (313111323111313).

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

Divisors: 1 2 4 8 59 118 236 472 216104050871 432208101742 864416203484 1728832406968 12750139001389 25500278002778 51000556005556 102001112011112