Search a number
-
+
201000111211 = 1011990100111
BaseRepresentation
bin1011101100110010001…
…0100100110001101011
3201012211001011121011101
42323030202210301223
511243122012024321
6232201013542231
720343653520064
oct2731442446153
9635731147141
10201000111211
1178275360599
1232b56644977
1315c53597b63
149a2ac5b56b
155366178791
hex2ecc8a4c6b

201000111211 has 4 divisors (see below), whose sum is σ = 202990211424. Its totient is φ = 199010011000.

The previous prime is 201000111139. The next prime is 201000111281. The reversal of 201000111211 is 112111000102.

201000111211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-201000111211 is a prime.

It is a Duffinian number.

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

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, 995049955 + ... + 995050156.

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

Almost surely, 2201000111211 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1990100212.

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

Adding to 201000111211 its reverse (112111000102), we get a palindrome (313111111313).

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

Divisors: 1 101 1990100111 201000111211