Search a number
-
+
201101102011 = 296934520759
BaseRepresentation
bin1011101101001010001…
…1110100101110111011
3201020002002012110111101
42323102203310232323
511243323340231021
6232215022312231
720346321106645
oct2732243645673
9636062173441
10201101102011
1178317369467
1232b84428677
1315c6b497624
149a3a429895
15536ee76a91
hex2ed28f4bbb

201101102011 has 4 divisors (see below), whose sum is σ = 208035622800. Its totient is φ = 194166581224.

The previous prime is 201101101991. The next prime is 201101102017. The reversal of 201101102011 is 110201101102.

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

It is a cyclic number.

It is not a de Polignac number, because 201101102011 - 29 = 201101101499 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (201101102017) by changing a digit.

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 in 3 ways as a sum of consecutive naturals, for example, 3467260351 + ... + 3467260408.

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

Almost surely, 2201101102011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6934520788.

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

Adding to 201101102011 its reverse (110201101102), we get a palindrome (311302203113).

Subtracting from 201101102011 its reverse (110201101102), we obtain a palindrome (90900000909).

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

Divisors: 1 29 6934520759 201101102011