Search a number
-
+
200102011001 is a prime number
BaseRepresentation
bin1011101001011100000…
…0100110000001111001
3201010111110020101021122
42322113000212001321
511234302103323001
6231531532315025
720312500013114
oct2722700460171
9633443211248
10200102011001
1177954406612
1232945912a75
1315b3c4b8109
14998387757b
1553123c4b1b
hex2e97026079

200102011001 has 2 divisors, whose sum is σ = 200102011002. Its totient is φ = 200102011000.

The previous prime is 200102010989. The next prime is 200102011003. The reversal of 200102011001 is 100110201002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105299601001 + 94802410000 = 324499^2 + 307900^2 .

It is a cyclic number.

It is not a de Polignac number, because 200102011001 - 210 = 200102009977 is a prime.

Together with 200102011003, it forms a pair of twin primes.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (200102011003) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100051005500 + 100051005501.

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

Almost surely, 2200102011001 is an apocalyptic number.

It is an amenable number.

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

200102011001 is an equidigital number, since it uses as much as digits as its factorization.

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

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

Adding to 200102011001 its reverse (100110201002), we get a palindrome (300212212003).

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