Search a number
-
+
200122202201137 is a prime number
BaseRepresentation
bin101101100000001010010100…
…110001100001110000110001
3222020120111101100122002002221
4231200022110301201300301
5202212300232230414022
61545342512010441041
760103231505014426
oct5540122461416061
9866514340562087
10200122202201137
1158846392a70807
121a541034733181
13878859a798738
14375bd7561bd4d
151820987548cc7
hexb60294c61c31

200122202201137 has 2 divisors, whose sum is σ = 200122202201138. Its totient is φ = 200122202201136.

The previous prime is 200122202201107. The next prime is 200122202201153. The reversal of 200122202201137 is 731102202221002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 113801082082081 + 86321120119056 = 10667759^2 + 9290916^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-200122202201137 is a prime.

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

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

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

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

Almost surely, 2200122202201137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1344, while the sum is 25.

Adding to 200122202201137 its reverse (731102202221002), we get a palindrome (931224404422139).

The spelling of 200122202201137 in words is "two hundred trillion, one hundred twenty-two billion, two hundred two million, two hundred one thousand, one hundred thirty-seven".