Search a number
-
+
121602156029 is a prime number
BaseRepresentation
bin111000101000000001…
…1011010010111111101
3102121212122220120101122
41301100003122113331
53443020122443104
6131510244120325
711533262162144
oct1612003322775
9377778816348
10121602156029
1147631279712
121b6983960a5
13b60c0c65a3
145c5803c75b
15326a97d6be
hex1c500da5fd

121602156029 has 2 divisors, whose sum is σ = 121602156030. Its totient is φ = 121602156028.

The previous prime is 121602155999. The next prime is 121602156047. The reversal of 121602156029 is 920651206121.

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., 119972176900 + 1629979129 = 346370^2 + 40373^2 .

It is a cyclic number.

It is not a de Polignac number, because 121602156029 - 212 = 121602151933 is a prime.

It is a super-2 number, since 2×1216021560292 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 121602156029.

It is a congruent number.

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

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

Almost surely, 2121602156029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 35.

The spelling of 121602156029 in words is "one hundred twenty-one billion, six hundred two million, one hundred fifty-six thousand, twenty-nine".