Search a number
-
+
36135114051313 is a prime number
BaseRepresentation
bin10000011011101010111001…
…01000110000111011110001
311201221111001020011021120001
420031311130220300323301
514214014203144120223
6204504124153150001
710416450545366344
oct1015653450607361
9151844036137501
1036135114051313
11105718a7929022
1240772886bb301
1317216b0025824
148ccd3d91445b
15429e55a599ad
hex20dd5ca30ef1

36135114051313 has 2 divisors, whose sum is σ = 36135114051314. Its totient is φ = 36135114051312.

The previous prime is 36135114051251. The next prime is 36135114051343. The reversal of 36135114051313 is 31315041153163.

36135114051313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 30931528038544 + 5203586012769 = 5561612^2 + 2281137^2 .

It is a cyclic number.

It is not a de Polignac number, because 36135114051313 - 29 = 36135114050801 is a prime.

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

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

Almost surely, 236135114051313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 37.

The spelling of 36135114051313 in words is "thirty-six trillion, one hundred thirty-five billion, one hundred fourteen million, fifty-one thousand, three hundred thirteen".