Search a number
-
+
51201518707249 is a prime number
BaseRepresentation
bin10111010010001010010000…
…10101011010001000110001
320201021211001212120200210221
423221011020111122020301
523202341202242112444
6300521353013053041
713533121236055111
oct1351051025321061
9221254055520727
1051201518707249
1115350495542439
1258ab245027181
13227538984cb11
14c90249705041
155dbd07d3ca84
hex2e914855a231

51201518707249 has 2 divisors, whose sum is σ = 51201518707250. Its totient is φ = 51201518707248.

The previous prime is 51201518707243. The next prime is 51201518707277. The reversal of 51201518707249 is 94270781510215.

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., 40335925017249 + 10865593690000 = 6351057^2 + 3296300^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51201518707249 is a prime.

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

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

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

Almost surely, 251201518707249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1411200, while the sum is 52.

The spelling of 51201518707249 in words is "fifty-one trillion, two hundred one billion, five hundred eighteen million, seven hundred seven thousand, two hundred forty-nine".