Search a number
-
+
11111111102102 = 211505050504641
BaseRepresentation
bin1010000110110000000111…
…0101001000111010010110
31110100012201102210111020012
42201230001311020322112
52424021023420231402
635344212440040222
72224515456026444
oct241540165107226
943305642714205
1011111111102102
1135a4217607520
1212b54a8763072
13627a08b8b00b
142a5ad0147b94
1514405b0cc452
hexa1b01d48e96

11111111102102 has 8 divisors (see below), whose sum is σ = 18181818167112. Its totient is φ = 5050505046400.

The previous prime is 11111111102057. The next prime is 11111111102137. The reversal of 11111111102102 is 20120111111111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252525252299 + ... + 252525252342.

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

Almost surely, 211111111102102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 505050504654.

The product of its (nonzero) digits is 4, while the sum is 14.

Adding to 11111111102102 its reverse (20120111111111), we get a palindrome (31231222213213).

Subtracting 11111111102102 from its reverse (20120111111111), we obtain a palindrome (9009000009009).

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

Divisors: 1 2 11 22 505050504641 1010101009282 5555555551051 11111111102102