Search a number
-
+
5601093755561 is a prime number
BaseRepresentation
bin101000110000001101100…
…1101000010001010101001
3201211110101212001201110122
41101200123031002022221
51213232020000134221
615525035033453025
71115444216244653
oct121403315021251
921743355051418
105601093755561
11186a45744a877
12765642b71175
133182474c70c5
14155146dc16d3
159aa6d5deeab
hex5181b3422a9

5601093755561 has 2 divisors, whose sum is σ = 5601093755562. Its totient is φ = 5601093755560.

The previous prime is 5601093755549. The next prime is 5601093755563. The reversal of 5601093755561 is 1655573901065.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5523233224336 + 77860531225 = 2350156^2 + 279035^2 .

It is a cyclic number.

It is not a de Polignac number, because 5601093755561 - 222 = 5601089561257 is a prime.

Together with 5601093755563, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 25601093755561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4252500, while the sum is 53.

The spelling of 5601093755561 in words is "five trillion, six hundred one billion, ninety-three million, seven hundred fifty-five thousand, five hundred sixty-one".