Search a number
-
+
200110109999897 is a prime number
BaseRepresentation
bin101101011111111111000100…
…000001011100001100011001
3222020112100011122000121102202
4231133333010001130030121
5202212101001124444042
61545333152044535545
760102323034006416
oct5537770401341431
9866470148017382
10200110109999897
1158841248264a69
121a53a81ab515b5
1387873c14c1086
14375b54967d10d
1518204cab64632
hexb5ffc405c319

200110109999897 has 2 divisors, whose sum is σ = 200110109999898. Its totient is φ = 200110109999896.

The previous prime is 200110109999893. The next prime is 200110110000007. The reversal of 200110109999897 is 798999901011002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 152886770538121 + 47223339461776 = 12364739^2 + 6871924^2 .

It is a cyclic number.

It is not a de Polignac number, because 200110109999897 - 22 = 200110109999893 is a prime.

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

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

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

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

Almost surely, 2200110109999897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6613488, while the sum is 65.

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