Search a number
-
+
200210996806897 is a prime number
BaseRepresentation
bin101101100001011101000001…
…010110000100010011110001
3222020212222120121100102012011
4231201131001112010103301
5202220224110140310042
61545451355011202521
760112524066505156
oct5541350126042361
9866788517312164
10200210996806897
115888000923130a
121a5562958a6441
138793a7b95818b
14376239a3c422d
151822e32b71a17
hexb617415844f1

200210996806897 has 2 divisors, whose sum is σ = 200210996806898. Its totient is φ = 200210996806896.

The previous prime is 200210996806889. The next prime is 200210996806901. The reversal of 200210996806897 is 798608699012002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 167426027941041 + 32784968865856 = 12939321^2 + 5725816^2 .

It is a cyclic number.

It is not a de Polignac number, because 200210996806897 - 23 = 200210996806889 is a prime.

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

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

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

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

Almost surely, 2200210996806897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 47029248, while the sum is 67.

The spelling of 200210996806897 in words is "two hundred trillion, two hundred ten billion, nine hundred ninety-six million, eight hundred six thousand, eight hundred ninety-seven".