Search a number
-
+
50325199950791 is a prime number
BaseRepresentation
bin10110111000101001111111…
…01010101001001111000111
320121012001010201020102121202
423130110333222221033013
523044012002141411131
6255011024440533115
713412606240405663
oct1334247752511707
9217161121212552
1050325199950791
11150428854403a7
12578943b78119b
132210852325b6c
14c5da774a18a3
155c411983abcb
hex2dc53faa93c7

50325199950791 has 2 divisors, whose sum is σ = 50325199950792. Its totient is φ = 50325199950790.

The previous prime is 50325199950719. The next prime is 50325199950793. The reversal of 50325199950791 is 19705999152305.

Together with previous prime (50325199950719) 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 50325199950791 - 214 = 50325199934407 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 250325199950791 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 34445250, while the sum is 65.

The spelling of 50325199950791 in words is "fifty trillion, three hundred twenty-five billion, one hundred ninety-nine million, nine hundred fifty thousand, seven hundred ninety-one".