Search a number
-
+
110110001102 = 255055000551
BaseRepresentation
bin110011010001100010…
…0010100011111001110
3101112012202101121111222
41212203010110133032
53301001130013402
6122330035243342
710645425365243
oct1464304243716
9345182347458
10110110001102
1142774252612
121940b749552
13a4ca23290a
145487a595ca
152ce6ac57a2
hex19a31147ce

110110001102 has 4 divisors (see below), whose sum is σ = 165165001656. Its totient is φ = 55055000550.

The previous prime is 110110001101. The next prime is 110110001153. The reversal of 110110001102 is 201100011011.

It is a happy number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110110001102.

It is a congruent number.

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

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

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

Almost surely, 2110110001102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55055000553.

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

Adding to 110110001102 its reverse (201100011011), we get a palindrome (311210012113).

Subtracting 110110001102 from its reverse (201100011011), we obtain a palindrome (90990009909).

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

Divisors: 1 2 55055000551 110110001102