Search a number
-
+
50323453213151 is a prime number
BaseRepresentation
bin10110111000100110101111…
…00011010111100111011111
320121011212121222102222001002
423130103113203113213133
523043444413010310101
6255010135242140515
713412515040364266
oct1334232743274737
9217155558388032
1050323453213151
1115042069455578
1257890327b173b
1322106344940b1
14c5d94d4d15dd
155c4066303d6b
hex2dc4d78d79df

50323453213151 has 2 divisors, whose sum is σ = 50323453213152. Its totient is φ = 50323453213150.

The previous prime is 50323453213147. The next prime is 50323453213153. The reversal of 50323453213151 is 15131235432305.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50323453213151 - 22 = 50323453213147 is a prime.

Together with 50323453213153, 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 (50323453213153) by changing a digit.

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

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

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

Almost surely, 250323453213151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 162000, while the sum is 38.

Adding to 50323453213151 its reverse (15131235432305), we get a palindrome (65454688645456).

The spelling of 50323453213151 in words is "fifty trillion, three hundred twenty-three billion, four hundred fifty-three million, two hundred thirteen thousand, one hundred fifty-one".