Search a number
-
+
201011011001102 = 2100505505500551
BaseRepresentation
bin101101101101000110000101…
…111010000001101100001110
3222100201110112222012021222002
4231231012011322001230032
5202321331022304013402
61551303103355552302
760224365145115551
oct5555060572015416
9870643488167862
10201011011001102
1159059322400355
121a665344a5b692
138821345834493
14378cdb05a2698
151838b57319602
hexb6d185e81b0e

201011011001102 has 4 divisors (see below), whose sum is σ = 301516516501656. Its totient is φ = 100505505500550.

The previous prime is 201011011001093. The next prime is 201011011001173. The reversal of 201011011001102 is 201100110110102.

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

It is a super-3 number, since 3×2010110110011023 (a number of 44 digits) contains 333 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 (23) of ones.

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

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

Almost surely, 2201011011001102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100505505500553.

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

Adding to 201011011001102 its reverse (201100110110102), we get a palindrome (402111121111204).

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

Divisors: 1 2 100505505500551 201011011001102