Search a number
-
+
110110110110010 = 23259733233795619
BaseRepresentation
bin11001000010010100000001…
…111111111101000100111010
3112102212102102220010221000200
4121002110001333331010322
5103413021001142010020
61030103515233343030
732123123114150463
oct3102240177750472
9472772386127020
10110110110110010
11320a248765760a
12104240b1107a76
1349594535417ca
141d295019c7d6a
15cae33b30a590
hex642501ffd13a

110110110110010 has 96 divisors (see below), whose sum is σ = 289324808660160. Its totient is φ = 29051235062784.

The previous prime is 110110110109991. The next prime is 110110110110051. The reversal of 110110110110010 is 10011011011011.

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 = 110110110109974 and 110110110110001.

It is an unprimeable number.

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 47 ways as a sum of consecutive naturals, for example, 27111981 + ... + 30907599.

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

Almost surely, 2110110110110010 is an apocalyptic number.

110110110110010 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 110110110110010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144662404330080).

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

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

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

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

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

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

Adding to 110110110110010 its reverse (10011011011011), we get a palindrome (120121121121021).

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

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 97 194 291 485 582 873 970 1455 1746 2910 3323 4365 6646 8730 9969 16615 19938 29907 33230 49845 59814 99690 149535 299070 322331 644662 966993 1611655 1933986 2900979 3223310 3795619 4834965 5801958 7591238 9669930 11386857 14504895 18978095 22773714 29009790 34160571 37956190 56934285 68321142 113868570 170802855 341605710 368175043 736350086 1104525129 1840875215 2209050258 3313575387 3681750430 5522625645 6627150774 11045251290 12612841937 16567876935 25225683874 33135753870 37838525811 63064209685 75677051622 113515577433 126128419370 189192629055 227031154866 378385258110 567577887165 1135155774330 1223445667889 2446891335778 3670337003667 6117228339445 7340674007334 11011011011001 12234456678890 18351685018335 22022022022002 36703370036670 55055055055005 110110110110010