Search a number
-
+
200211001092931 is a prime number
BaseRepresentation
bin101101100001011101000001…
…100110011010101101000011
3222020212222120220102011112011
4231201131001212122231003
5202220224112234433211
61545451355243113351
760112524151105663
oct5541350146325503
9866788526364464
10200211001092931
1158880010699494
121a556297212857
138793a7c7c8caa
14376239abbc1a3
151822e3321b921
hexb6174199ab43

200211001092931 has 2 divisors, whose sum is σ = 200211001092932. Its totient is φ = 200211001092930.

The previous prime is 200211001092923. The next prime is 200211001092943. The reversal of 200211001092931 is 139290100112002.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 200211001092931 - 23 = 200211001092923 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (200211001092911) 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, 100105500546465 + 100105500546466.

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

Almost surely, 2200211001092931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 31.

The spelling of 200211001092931 in words is "two hundred trillion, two hundred eleven billion, one million, ninety-two thousand, nine hundred thirty-one".