Search a number
-
+
110110110110110 = 251131412712906161
BaseRepresentation
bin11001000010010100000001…
…111111111101000110011110
3112102212102102220010221011101
4121002110001333331012132
5103413021001142010420
61030103515233343314
732123123114150665
oct3102240177750636
9472772386127141
10110110110110110
11320a24876576a0
12104240b1107b3a
134959453541876
141d295019c7ddc
15cae33b30a60a
hex642501ffd19e

110110110110110 has 128 divisors (see below), whose sum is σ = 229478363283456. Its totient is φ = 37663833600000.

The previous prime is 110110110110083. The next prime is 110110110110113. The reversal of 110110110110110 is 11011011011011.

It is a happy number.

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

110110110110110 is a modest number, since divided by 110110110 gives 110110 as remainder.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 36435430 + ... + 39341590.

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

Almost surely, 2110110110110110 is an apocalyptic number.

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

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

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

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

110110110110110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2906522.

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

110110110110110 divided by its sum of digits (10) gives a palindrome (11011011011011).

Adding to 110110110110110 its reverse (11011011011011), we get a palindrome (121121121121121).

Subtracting from 110110110110110 its reverse (11011011011011), we obtain a palindrome (99099099099099).

It can be divided in two parts, 1101101 and 10110110, that added together give a palindrome (11211211).

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

Divisors: 1 2 5 10 11 22 31 41 55 62 82 110 155 205 271 310 341 410 451 542 682 902 1271 1355 1705 2255 2542 2710 2981 3410 4510 5962 6355 8401 11111 12710 13981 14905 16802 22222 27962 29810 42005 55555 69905 84010 92411 111110 122221 139810 184822 244442 344441 462055 611105 688882 924110 1222210 1722205 2906161 3444410 3788851 5812322 7577702 14530805 18944255 29061610 31967771 37888510 63935542 90090991 119152601 159838855 180181982 238305202 319677710 450454955 595763005 787569631 900909910 991000901 1191526010 1310678611 1575139262 1982001802 2621357222 3693730631 3937848155 4955004505 6553393055 7387461262 7875696310 8663265941 9910009010 13106786110 17326531882 18468653155 24414658561 32290354871 36937306310 40631036941 43316329705 48829317122 64580709742 81262073882 86632659410 122073292805 161451774355 203155184705 244146585610 268561244171 322903548710 355193903581 406310369410 537122488342 710387807162 1001001001001 1342806220855 1775969517905 2002002002002 2685612441710 3551939035810 5005005005005 10010010010010 11011011011011 22022022022022 55055055055055 110110110110110