Search a number
-
+
110111101102 = 255055550551
BaseRepresentation
bin110011010001100100…
…0100001000010101110
3101112012211110111102201
41212203020201002232
53301001420213402
6122330115012114
710645440626242
oct1464310410256
9345184414381
10110111101102
1142774934002
121940bb9a03a
13a4ca5294c2
145487c64422
152ce6c41687
hex19a32210ae

110111101102 has 4 divisors (see below), whose sum is σ = 165166651656. Its totient is φ = 55055550550.

The previous prime is 110111101043. The next prime is 110111101103. The reversal of 110111101102 is 201101111011.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201101111011 = 547367643713.

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

It is a congruent number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27527775274 + ... + 27527775277.

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

Almost surely, 2110111101102 is an apocalyptic number.

110111101102 is a deficient number, since it is larger than the sum of its proper divisors (55055550554).

110111101102 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 55055550553.

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

Adding to 110111101102 its reverse (201101111011), we get a palindrome (311212212113).

Subtracting 110111101102 from its reverse (201101111011), we obtain a palindrome (90990009909).

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

Divisors: 1 2 55055550551 110111101102