Search a number
-
+
51013319999933 is a prime number
BaseRepresentation
bin10111001100101011101101…
…10100010100000110111101
320200121211021222111210110202
423212111312310110012331
523141300234404444213
6300255110133413245
713513406424333164
oct1346256664240675
9220554258453422
1051013319999933
111528869a253095
12587a88179a225
1322606c6471685
14c850b4ab83db
155d6e90987b58
hex2e6576d141bd

51013319999933 has 2 divisors, whose sum is σ = 51013319999934. Its totient is φ = 51013319999932.

The previous prime is 51013319999923. The next prime is 51013319999977. The reversal of 51013319999933 is 33999991331015.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 50990639037529 + 22680962404 = 7140773^2 + 150602^2 .

It is a cyclic number.

It is not a de Polignac number, because 51013319999933 - 230 = 51012246258109 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 51013319999933.

It is a congruent number.

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

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

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

Almost surely, 251013319999933 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23914845, while the sum is 65.

The spelling of 51013319999933 in words is "fifty-one trillion, thirteen billion, three hundred nineteen million, nine hundred ninety-nine thousand, nine hundred thirty-three".