Search a number
-
+
201102011120002 = 2100551005560001
BaseRepresentation
bin101101101110011010110101…
…111011111011100110000010
3222101001011102220222022022011
4231232122311323323212002
5202324323404321320002
61551412553304203134
760234066210266626
oct5556326573734602
9871034386868264
10201102011120002
115909397a616593
121a67ab007694aa
138829ab8905a95
14379356423d186
15183b1d139c8d7
hexb6e6b5efb982

201102011120002 has 4 divisors (see below), whose sum is σ = 301653016680006. Its totient is φ = 100551005560000.

The previous prime is 201102011119981. The next prime is 201102011120053. The reversal of 201102011120002 is 200021110201102.

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

It can be written as a sum of positive squares in only one way, i.e., 136170018594481 + 64931992525521 = 11669191^2 + 8058039^2 .

It is an unprimeable number.

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

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

Almost surely, 2201102011120002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100551005560003.

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 201102011120002 its reverse (200021110201102), we get a palindrome (401123121321104).

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

Divisors: 1 2 100551005560001 201102011120002