Search a number
-
+
200001102011 = 13912011198049
BaseRepresentation
bin1011101001000011111…
…1101010000010111011
3201010020102100200011122
42322100333222002323
511234100240231021
6231513525415455
720310133213604
oct2722077520273
9633212320148
10200001102011
1177902454157
1232917b6a58b
1315b24616959
1499742cadab
1553085e0bab
hex2e90fea0bb

200001102011 has 8 divisors (see below), whose sum is σ = 201607854000. Its totient is φ = 198396748800.

The previous prime is 200001101999. The next prime is 200001102013. The reversal of 200001102011 is 110201100002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a super-2 number, since 2×2000011020112 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 200001102011.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 432086 + ... + 765963.

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

Almost surely, 2200001102011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1199389.

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

Adding to 200001102011 its reverse (110201100002), we get a palindrome (310202202013).

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

Divisors: 1 139 1201 166939 1198049 166528811 1438856849 200001102011