Search a number
-
+
50600153231 is a prime number
BaseRepresentation
bin101111001000000000…
…010001000010001111
311211121102010010002022
4233020000101002033
51312112114400411
635125000520355
73440630130425
oct571000210217
9154542103068
1050600153231
111a506516061
129981a800bb
134a051c0294
142640317115
1514b23e2edb
hexbc801108f

50600153231 has 2 divisors, whose sum is σ = 50600153232. Its totient is φ = 50600153230.

The previous prime is 50600153213. The next prime is 50600153237. The reversal of 50600153231 is 13235100605.

Together with previous prime (50600153213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50600153231 - 26 = 50600153167 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 250600153231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 26.

Adding to 50600153231 its reverse (13235100605), we get a palindrome (63835253836).

The spelling of 50600153231 in words is "fifty billion, six hundred million, one hundred fifty-three thousand, two hundred thirty-one".