Search a number
-
+
11011100110102 = 25505550055051
BaseRepresentation
bin1010000000111011100010…
…1101011110110100010110
31102222122120111110200210101
42200032320231132310112
52420401213112010402
635230232441244314
72214345216440341
oct240167055366426
942878514420711
1011011100110102
113565865a53a24
12129a03719369a
1361b45b000341
142a0d23865458
15141655e20b87
hexa03b8b5ed16

11011100110102 has 4 divisors (see below), whose sum is σ = 16516650165156. Its totient is φ = 5505550055050.

The previous prime is 11011100110067. The next prime is 11011100110139. The reversal of 11011100110102 is 20101100111011.

11011100110102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 211011100110102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5505550055053.

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

Adding to 11011100110102 its reverse (20101100111011), we get a palindrome (31112200221113).

Subtracting 11011100110102 from its reverse (20101100111011), we obtain a palindrome (9090000000909).

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

Divisors: 1 2 5505550055051 11011100110102