Search a number
-
+
121606952557 is a prime number
BaseRepresentation
bin111000101000001010…
…1101101011001101101
3102121212222221020222211
41301100111231121231
53443022334440212
6131510535010421
711533351020166
oct1612025553155
9377788836884
10121606952557
1147633a55392
121b699b09a11
13b6100b587c
145c5892a76d
15326b0c99a7
hex1c5056d66d

121606952557 has 2 divisors, whose sum is σ = 121606952558. Its totient is φ = 121606952556.

The previous prime is 121606952521. The next prime is 121606952563. The reversal of 121606952557 is 755259606121.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 118946352996 + 2660599561 = 344886^2 + 51581^2 .

It is a cyclic number.

It is not a de Polignac number, because 121606952557 - 27 = 121606952429 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2121606952557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1134000, while the sum is 49.

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