Search a number
-
+
565150051541 is a prime number
BaseRepresentation
bin10000011100101011001…
…00010110110011010101
32000000202021112020120102
420032111210112303111
533224411403122131
61111343142543445
755554642114515
oct10162544266325
92000667466512
10565150051541
111a875151a4a9
1291643737b85
13413a785302a
141d4d3a77845
15ea7a57c1cb
hex8395916cd5

565150051541 has 2 divisors, whose sum is σ = 565150051542. Its totient is φ = 565150051540.

The previous prime is 565150051517. The next prime is 565150051567. The reversal of 565150051541 is 145150051565.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 304570430641 + 260579620900 = 551879^2 + 510470^2 .

It is a cyclic number.

It is not a de Polignac number, because 565150051541 - 238 = 290272144597 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2565150051541 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 565150051541 in words is "five hundred sixty-five billion, one hundred fifty million, fifty-one thousand, five hundred forty-one".