Search a number
-
+
51110531273 is a prime number
BaseRepresentation
bin101111100110011011…
…001101000011001001
311212220222111000010202
4233212123031003021
51314133244000043
635251352021545
73456365230154
oct574633150311
9155828430122
1051110531273
111a74862069a
129aa49918b5
134a86b6a019
14268c010c9b
1514e210b1b8
hexbe66cd0c9

51110531273 has 2 divisors, whose sum is σ = 51110531274. Its totient is φ = 51110531272.

The previous prime is 51110531261. The next prime is 51110531287. The reversal of 51110531273 is 37213501115.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 50063167504 + 1047363769 = 223748^2 + 32363^2 .

It is a cyclic number.

It is not a de Polignac number, because 51110531273 - 26 = 51110531209 is a prime.

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

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

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

Almost surely, 251110531273 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 29.

The spelling of 51110531273 in words is "fifty-one billion, one hundred ten million, five hundred thirty-one thousand, two hundred seventy-three".