Search a number
-
+
201043395437 is a prime number
BaseRepresentation
bin1011101100111100011…
…1101100001101101101
3201012221001121122221212
42323033013230031231
511243214102123222
6232205201404205
720345020444133
oct2731707541555
9635831548855
10201043395437
1178297834685
1232b69039665
1315c5c541521
149a328c7753
155369d786e2
hex2ecf1ec36d

201043395437 has 2 divisors, whose sum is σ = 201043395438. Its totient is φ = 201043395436.

The previous prime is 201043395341. The next prime is 201043395461. The reversal of 201043395437 is 734593340102.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 177519811561 + 23523583876 = 421331^2 + 153374^2 .

It is a cyclic number.

It is not a de Polignac number, because 201043395437 - 28 = 201043395181 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2201043395437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 272160, while the sum is 41.

The spelling of 201043395437 in words is "two hundred one billion, forty-three million, three hundred ninety-five thousand, four hundred thirty-seven".