Search a number
-
+
200121010211701 is a prime number
BaseRepresentation
bin101101100000001001001101…
…101110011100101101110101
3222020120101022021200202000001
4231200021031232130231311
5202212240312103233301
61545342153430151301
760103160122201525
oct5540111556345565
9866511267622001
10200121010211701
1158845931136477
121a5409614b2531
13878843a84a447
14375bca11b5685
151820917a91c01
hexb6024db9cb75

200121010211701 has 2 divisors, whose sum is σ = 200121010211702. Its totient is φ = 200121010211700.

The previous prime is 200121010211699. The next prime is 200121010211737. The reversal of 200121010211701 is 107112010121002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 144020520731025 + 56100489480676 = 12000855^2 + 7490026^2 .

It is a cyclic number.

It is not a de Polignac number, because 200121010211701 - 21 = 200121010211699 is a prime.

Together with 200121010211699, it forms a pair of twin primes.

It is a congruent number.

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

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

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

Almost surely, 2200121010211701 is an apocalyptic number.

It is an amenable number.

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

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

200121010211701 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 200121010211701 its reverse (107112010121002), we get a palindrome (307233020332703).

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