Search a number
-
+
200102041141 is a prime number
BaseRepresentation
bin1011101001011100000…
…0101101011000110101
3201010111110021220121221
42322113000231120311
511234302110304031
6231531533110341
720312500200022
oct2722700553065
9633443256557
10200102041141
1177954427222
12329459283b1
1315b3c4c8a52
149983884549
1553123cda11
hex2e9702d635

200102041141 has 2 divisors, whose sum is σ = 200102041142. Its totient is φ = 200102041140.

The previous prime is 200102041133. The next prime is 200102041147. The reversal of 200102041141 is 141140201002.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122885302500 + 77216738641 = 350550^2 + 277879^2 .

It is a cyclic number.

It is not a de Polignac number, because 200102041141 - 23 = 200102041133 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (200102041147) 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 as a sum of consecutive naturals, namely, 100051020570 + 100051020571.

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

Almost surely, 2200102041141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 16.

Adding to 200102041141 its reverse (141140201002), we get a palindrome (341242242143).

The spelling of 200102041141 in words is "two hundred billion, one hundred two million, forty-one thousand, one hundred forty-one".