Search a number
-
+
30121313322173 is a prime number
BaseRepresentation
bin1101101100101001010100…
…01011100100010010111101
310221122120101010010001022112
412312110222023210102331
512422001422202302143
6144021312412423405
76226123136536223
oct666245213442275
9127576333101275
1030121313322173
1196634171225a7
123465866a77b65
1313a6573747318
14761c44cc0b13
153737d0201e18
hex1b652a2e44bd

30121313322173 has 2 divisors, whose sum is σ = 30121313322174. Its totient is φ = 30121313322172.

The previous prime is 30121313322019. The next prime is 30121313322179. The reversal of 30121313322173 is 37122331312103.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 26854336601689 + 3266976720484 = 5182117^2 + 1807478^2 .

It is a cyclic number.

It is not a de Polignac number, because 30121313322173 - 216 = 30121313256637 is a prime.

It is a congruent number.

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

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

Almost surely, 230121313322173 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 32.

Adding to 30121313322173 its reverse (37122331312103), we get a palindrome (67243644634276).

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