Search a number
-
+
51050056050661 is a prime number
BaseRepresentation
bin10111001101110000001000…
…11101001110011111100101
320200202100010011212112022011
423212320010131032133211
523142401003322110121
6300324023314434221
713516146656530663
oct1346700435163745
9220670104775264
1051050056050661
11152a223084a798
125885a14592971
132263ccc2549b5
14c86b9b9b1c33
155d7de0b3d7e1
hex2e6e0474e7e5

51050056050661 has 2 divisors, whose sum is σ = 51050056050662. Its totient is φ = 51050056050660.

The previous prime is 51050056050601. The next prime is 51050056050667. The reversal of 51050056050661 is 16605065005015.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28658998628100 + 22391057422561 = 5353410^2 + 4731919^2 .

It is a cyclic number.

It is not a de Polignac number, because 51050056050661 - 215 = 51050056017893 is a prime.

It is a super-2 number, since 2×510500560506612 (a number of 28 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 251050056050661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 51050056050661 in words is "fifty-one trillion, fifty billion, fifty-six million, fifty thousand, six hundred sixty-one".