Search a number
-
+
200010202011 = 3247795985283
BaseRepresentation
bin1011101001000110001…
…0010111101110011011
3201010021001111000000200
42322101202113232123
511234110102431021
6231514452433243
720310303444324
oct2722142275633
9633231430020
10200010202011
11779075aa114
123291b018823
1315b26481979
1499755b944b
1553092dc126
hex2e91897b9b

200010202011 has 24 divisors (see below), whose sum is σ = 298785377280. Its totient is φ = 128851150896.

The previous prime is 200010201991. The next prime is 200010202033. The reversal of 200010202011 is 110202010002.

It is not a de Polignac number, because 200010202011 - 26 = 200010201947 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 200010201984 and 200010202002.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2959225 + ... + 3026058.

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

Almost surely, 2200010202011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5985415 (or 5985412 counting only the distinct ones).

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

Adding to 200010202011 its reverse (110202010002), we get a palindrome (310212212013).

The spelling of 200010202011 in words is "two hundred billion, ten million, two hundred two thousand, eleven".

Divisors: 1 3 9 47 79 141 237 423 711 3713 11139 33417 5985283 17955849 53867547 281308301 472837357 843924903 1418512071 2531774709 4255536213 22223355779 66670067337 200010202011