Search a number
-
+
110020102000110 = 232561711097257297
BaseRepresentation
bin11001000001000000001101…
…000110010000110111101110
3112102112211010002000012012200
4121001000031012100313232
5103410032132103000420
61025554312003242330
732113455455636061
oct3101001506206756
9472484102005180
10110020102000110
11320682993a7425
121040a7716793a6
134950b0ab40093
141d250039b88d8
15cabd1e3cab90
hex64100d190dee

110020102000110 has 192 divisors, whose sum is σ = 295106512581504. Its totient is φ = 28425238732800.

The previous prime is 110020102000091. The next prime is 110020102000141. The reversal of 110020102000110 is 11000201020011.

It is a happy number.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 110020102000092 and 110020102000101.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 427470982 + ... + 427728278.

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

Almost surely, 2110020102000110 is an apocalyptic number.

110020102000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 110020102000110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147553256290752).

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

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

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

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

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

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

Adding to 110020102000110 its reverse (11000201020011), we get a palindrome (121020303020121).

It can be divided in two parts, 1100201020001 and 10, that added together give a palindrome (1100201020011).

The spelling of 110020102000110 in words is "one hundred ten trillion, twenty billion, one hundred two million, one hundred ten", and thus it is an aban number.