Search a number
-
+
200012101111 = 1071869271973
BaseRepresentation
bin1011101001000110100…
…1100111010111110111
3201010021012001111002201
42322101221213113313
511234111044213421
6231515001245331
720310325544134
oct2722151472767
9633235044081
10200012101111
1177908686a19
123291b793847
1315b269981b4
14997595158b
155309564b91
hex2e91a675f7

200012101111 has 4 divisors (see below), whose sum is σ = 201881373192. Its totient is φ = 198142829032.

The previous prime is 200012101099. The next prime is 200012101127. The reversal of 200012101111 is 111101210002.

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-200012101111 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (200012101141) 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, 934635880 + ... + 934636093.

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

Almost surely, 2200012101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1869272080.

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

Adding to 200012101111 its reverse (111101210002), we get a palindrome (311113311113).

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

Divisors: 1 107 1869271973 200012101111