Search a number
-
+
200210111101027 is a prime number
BaseRepresentation
bin101101100001011100001100…
…100011010111100001100011
3222020212220021212201220011001
4231201130030203113201203
5202220220301420213102
61545451131051332431
760112463123232256
oct5541341443274143
9866786255656131
10200210111101027
115887a6a4282395
121a556089151117
13879396a2c7a71
14376231490909d
151822dd001a487
hexb6170c8d7863

200210111101027 has 2 divisors, whose sum is σ = 200210111101028. Its totient is φ = 200210111101026.

The previous prime is 200210111100983. The next prime is 200210111101061. The reversal of 200210111101027 is 720101111012002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 200210111101027 - 243 = 191414018078819 is a prime.

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

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

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

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

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

Almost surely, 2200210111101027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 19.

Adding to 200210111101027 its reverse (720101111012002), we get a palindrome (920311222113029).

The spelling of 200210111101027 in words is "two hundred trillion, two hundred ten billion, one hundred eleven million, one hundred one thousand, twenty-seven".