Search a number
-
+
312200030122121 is a prime number
BaseRepresentation
bin100011011111100011011101…
…1111001001111000010001001
31111221102000211212222201221002
41012333012323321033002021
5311410041130202401441
63023554414110024345
7122521464533464151
oct10677067371170211
91457360755881832
10312200030122121
119052731aa69739
122b02255a4a80b5
131052844b42c2bb
1457147c24d7761
15261608c6a3b9b
hex11bf1bbe4f089

312200030122121 has 2 divisors, whose sum is σ = 312200030122122. Its totient is φ = 312200030122120.

The previous prime is 312200030122091. The next prime is 312200030122133. The reversal of 312200030122121 is 121221030002213.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 300703726137721 + 11496303984400 = 17340811^2 + 3390620^2 .

It is a cyclic number.

It is not a de Polignac number, because 312200030122121 - 214 = 312200030105737 is a prime.

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

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

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

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

Almost surely, 2312200030122121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 312200030122121 its reverse (121221030002213), we get a palindrome (433421060124334).

The spelling of 312200030122121 in words is "three hundred twelve trillion, two hundred billion, thirty million, one hundred twenty-two thousand, one hundred twenty-one".