Search a number
-
+
201102110111102 = 2100551055055551
BaseRepresentation
bin101101101110011010111011…
…110101100011010101111110
3222101001011200211020120120012
4231232122323311203111332
5202324324110142023402
61551413011202023222
760234101521560464
oct5556327365432576
9871034624216505
10201102110111102
1159093a20489012
121a67ab29947b12
138829b032852b5
14379357344a834
15183b1d9e03452
hexb6e6bbd6357e

201102110111102 has 4 divisors (see below), whose sum is σ = 301653165166656. Its totient is φ = 100551055055550.

The previous prime is 201102110111093. The next prime is 201102110111209. The reversal of 201102110111102 is 201111011201102.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2201102110111102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100551055055553.

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

Adding to 201102110111102 its reverse (201111011201102), we get a palindrome (402213121312204).

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

Divisors: 1 2 100551055055551 201102110111102