Search a number
-
+
51548069761 is a prime number
BaseRepresentation
bin110000000000100000…
…010001111110000001
311221001110210021002221
4300000200101332001
51321032301213021
635403022011041
73503260235446
oct600040217601
9157043707087
1051548069761
111a9525a5851
129ba7416a81
134b266c2936
1426d01879cd
15151a737241
hexc00811f81

51548069761 has 2 divisors, whose sum is σ = 51548069762. Its totient is φ = 51548069760.

The previous prime is 51548069759. The next prime is 51548069789. The reversal of 51548069761 is 16796084515.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36750807025 + 14797262736 = 191705^2 + 121644^2 .

It is a cyclic number.

It is not a de Polignac number, because 51548069761 - 21 = 51548069759 is a prime.

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

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

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

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

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

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

Almost surely, 251548069761 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 51548069761 in words is "fifty-one billion, five hundred forty-eight million, sixty-nine thousand, seven hundred sixty-one".