Search a number
-
+
200010001011 = 33711171613153
BaseRepresentation
bin1011101001000110000…
…1100110101001110011
3201010021001002210022020
42322101201212221303
511234110030013021
6231514444242523
720310301646322
oct2722141465163
9633231083266
10200010001011
11779074820a7
123291ab40443
1315b26411332
1499755660b9
15530929c7c6
hex2e91866a73

200010001011 has 16 divisors (see below), whose sum is σ = 274132938144. Its totient is φ = 129619989504.

The previous prime is 200010000997. The next prime is 200010001019. The reversal of 200010001011 is 110100010002.

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

It is not a de Polignac number, because 200010001011 - 25 = 200010000979 is a prime.

It is not an unprimeable number, because it can be changed into a prime (200010001019) 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 15 ways as a sum of consecutive naturals, for example, 682590 + ... + 930563.

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

Almost surely, 2200010001011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1614310.

The product of its (nonzero) digits is 2, while the sum is 6.

Adding to 200010001011 its reverse (110100010002), we get a palindrome (310110011013).

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

Divisors: 1 3 37 111 1117 3351 41329 123987 1613153 4839459 59686661 179059983 1801891901 5405675703 66670000337 200010001011