Search a number
-
+
110111110002 = 23237165331997
BaseRepresentation
bin110011010001100100…
…0100011001101110010
3101112012211110221122100
41212203020203031302
53301001421010002
6122330115121230
710645440664215
oct1464310431562
9345184427570
10110111110002
114277493a763
121940bba3216
13a4ca53057a
145487c6777c
152ce6c4411c
hex19a3223372

110111110002 has 24 divisors (see below), whose sum is σ = 245022021036. Its totient is φ = 35711711136.

The previous prime is 110111109991. The next prime is 110111110019. The reversal of 110111110002 is 200011111011.

It can be written as a sum of positive squares in 2 ways, for example, as 98664463881 + 11446646121 = 314109^2 + 106989^2 .

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82665333 + ... + 82666664.

Almost surely, 2110111110002 is an apocalyptic number.

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

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

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

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

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

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

Adding to 110111110002 its reverse (200011111011), we get a palindrome (310122221013).

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

Divisors: 1 2 3 6 9 18 37 74 111 222 333 666 165331997 330663994 495995991 991991982 1487987973 2975975946 6117283889 12234567778 18351851667 36703703334 55055555001 110111110002