Search a number
-
+
136701602129 is a prime number
BaseRepresentation
bin111111101010000001…
…1001110100101010001
3111001211222011220111002
41333110003032211101
54214431102232004
6142444433431345
712606410305661
oct1772403164521
9431758156432
10136701602129
1152a7a543a94
12225b110b555
13cb77420c91
14688b54c1a1
15385138861e
hex1fd40ce951

136701602129 has 2 divisors, whose sum is σ = 136701602130. Its totient is φ = 136701602128.

The previous prime is 136701602119. The next prime is 136701602171. The reversal of 136701602129 is 921206107631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 81487411600 + 55214190529 = 285460^2 + 234977^2 .

It is a cyclic number.

It is not a de Polignac number, because 136701602129 - 220 = 136700553553 is a prime.

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

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

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

Almost surely, 2136701602129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 38.

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