Search a number
-
+
200211200011073 is a prime number
BaseRepresentation
bin101101100001011101001101…
…011101001110101101000001
3222020220000002202201020220202
4231201131031131032231001
5202220230014200323243
61545451431110414545
760112532114636156
oct5541351535165501
9866800082636822
10200211200011073
1158880102a02649
121a556331961455
138793ab1a94a34
1437623b939c22d
151822e459104b8
hexb6174d74eb41

200211200011073 has 2 divisors, whose sum is σ = 200211200011074. Its totient is φ = 200211200011072.

The previous prime is 200211200011027. The next prime is 200211200011171. The reversal of 200211200011073 is 370110002112002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 172615005719809 + 27596194291264 = 13138303^2 + 5253208^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2200211200011073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 20.

Adding to 200211200011073 its reverse (370110002112002), we get a palindrome (570321202123075).

The spelling of 200211200011073 in words is "two hundred trillion, two hundred eleven billion, two hundred million, eleven thousand, seventy-three".