Search a number
-
+
1135561567957 is a prime number
BaseRepresentation
bin10000100001100100101…
…111100110111011010101
311000120002020102121002021
4100201210233212323111
5122101112230133312
62225400401213141
7145020163032145
oct20414457467325
94016066377067
101135561567957
113a86529a0383
121640b53311b1
138311045c88b
143cd663d4925
151e8129abc07
hex10864be6ed5

1135561567957 has 2 divisors, whose sum is σ = 1135561567958. Its totient is φ = 1135561567956.

The previous prime is 1135561567939. The next prime is 1135561567967. The reversal of 1135561567957 is 7597651655311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 837140822116 + 298420745841 = 914954^2 + 546279^2 .

It is an emirp because it is prime and its reverse (7597651655311) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1135561567957 - 211 = 1135561565909 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21135561567957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 29767500, while the sum is 61.

The spelling of 1135561567957 in words is "one trillion, one hundred thirty-five billion, five hundred sixty-one million, five hundred sixty-seven thousand, nine hundred fifty-seven".