Search a number
-
+
50635131049 is a prime number
BaseRepresentation
bin101111001010000101…
…101100100010101001
311211200211221011122001
4233022011230202221
51312200043143144
635132250331001
73441533340526
oct571205544251
9154624834561
1050635131049
111a524236448
129991729a61
134a0c518c09
142644c2014d
1514b5501bd4
hexbca16c8a9

50635131049 has 2 divisors, whose sum is σ = 50635131050. Its totient is φ = 50635131048.

The previous prime is 50635131017. The next prime is 50635131061. The reversal of 50635131049 is 94013153605.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 26724075625 + 23911055424 = 163475^2 + 154632^2 .

It is a cyclic number.

It is not a de Polignac number, because 50635131049 - 25 = 50635131017 is a prime.

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

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

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

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

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

Almost surely, 250635131049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 37.

The spelling of 50635131049 in words is "fifty billion, six hundred thirty-five million, one hundred thirty-one thousand, forty-nine".