Search a number
-
+
1136078652809 is a prime number
BaseRepresentation
bin10000100010000011100…
…100001000010110001001
311000121102021102020011002
4100202003210020112021
5122103142113342214
62225523552144345
7145036042134152
oct20420344102611
94017367366132
101136078652809
113a8898866931
1216421a5380b5
1383193617249
143cdb4d56929
151e84309c1de
hex10883908589

1136078652809 has 2 divisors, whose sum is σ = 1136078652810. Its totient is φ = 1136078652808.

The previous prime is 1136078652743. The next prime is 1136078652853. The reversal of 1136078652809 is 9082568706311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1074274206784 + 61804446025 = 1036472^2 + 248605^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1136078652809 is a prime.

It is a super-3 number, since 3×11360786528093 (a number of 37 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (1136078652889) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 568039326404 + 568039326405.

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

Almost surely, 21136078652809 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4354560, while the sum is 56.

The spelling of 1136078652809 in words is "one trillion, one hundred thirty-six billion, seventy-eight million, six hundred fifty-two thousand, eight hundred nine".