Search a number
-
+
111010010020110 = 23252064195975441
BaseRepresentation
bin11001001111011010001000…
…001101101011100100001110
3112120001110020110120220201200
4121033122020031223210032
5104022242000031120420
61032033143343450330
732245131351162645
oct3117321015534416
9476043213526650
10111010010020110
113240a0986a4383
121054a5978b69a6
1349c3278355206
141d5acad99835c
15cc7959b65b90
hex64f68836b90e

111010010020110 has 48 divisors (see below), whose sum is σ = 288627472607760. Its totient is φ = 29602520974080.

The previous prime is 111010010020109. The next prime is 111010010020111. The reversal of 111010010020110 is 11020010010111.

It is an interprime number because it is at equal distance from previous prime (111010010020109) and next prime (111010010020111).

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 = 111010010020092 and 111010010020101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (111010010020111) by changing a digit.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15589990 + ... + 21565430.

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

Almost surely, 2111010010020110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111010010020110 its reverse (11020010010111), we get a palindrome (122030020030221).

Subtracting from 111010010020110 its reverse (11020010010111), we obtain a palindrome (99990000009999).

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

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 206419 412838 619257 1032095 1238514 1857771 2064190 3096285 3715542 5975441 6192570 9288855 11950882 17926323 18577710 29877205 35852646 53778969 59754410 89631615 107557938 179263230 268894845 537789690 1233444555779 2466889111558 3700333667337 6167222778895 7400667334674 11101001002011 12334445557790 18501668336685 22202002004022 37003336673370 55505005010055 111010010020110