Search a number
-
+
110011211110102 = 21193327831406429
BaseRepresentation
bin11001000000110111111011…
…001010001101011011010110
3112102111222011110020011222011
4121000313323022031123112
5103404410430021010402
61025550241440454434
732113022236422001
oct3100677312153326
9472458143204864
10110011211110102
113206454675a145
1210408ab001a41a
134950021b73013
141d247dcc86538
15cab99daa2ed7
hex640dfb28d6d6

110011211110102 has 16 divisors (see below), whose sum is σ = 165160292811840. Its totient is φ = 54957783053632.

The previous prime is 110011211110007. The next prime is 110011211110123. The reversal of 110011211110102 is 201011112110011.

It is a super-2 number, since 2×1100112111101022 (a number of 29 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, 77517024 + ... + 78923452.

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

Almost surely, 2110011211110102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1440407.

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

Adding to 110011211110102 its reverse (201011112110011), we get a palindrome (311022323220113).

Subtracting 110011211110102 from its reverse (201011112110011), we obtain a palindrome (90999900999909).

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

Divisors: 1 2 1193 2386 32783 65566 1406429 2812858 39110119 78220238 1677869797 3355739594 46106961907 92213923814 55005605555051 110011211110102