Search a number
-
+
201211020202037 is a prime number
BaseRepresentation
bin101101110000000000010111…
…011000100101000000110101
3222101102120210221210102202212
4231300000113120211000311
5202333120132132431122
61551535022215143205
760245005440223466
oct5560002730450065
9871376727712685
10201211020202037
115912612938632a
121a698063674b05
13883716ba255a1
14379894599ad6d
15183de614a9ce2
hexb70017625035

201211020202037 has 2 divisors, whose sum is σ = 201211020202038. Its totient is φ = 201211020202036.

The previous prime is 201211020201973. The next prime is 201211020202043. The reversal of 201211020202037 is 730202020112102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 135103567040836 + 66107453161201 = 11623406^2 + 8130649^2 .

It is a cyclic number.

It is not a de Polignac number, because 201211020202037 - 26 = 201211020201973 is a prime.

It is a congruent number.

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

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

Almost surely, 2201211020202037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 672, while the sum is 23.

Adding to 201211020202037 its reverse (730202020112102), we get a palindrome (931413040314139).

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