Search a number
-
+
50323033511 is a prime number
BaseRepresentation
bin101110110111011111…
…001000110110100111
311210220002122222021222
4232313133020312213
51311030144033021
635041301130555
73431023504262
oct566737106647
9153802588258
1050323033511
111a3840499a3
1299050b9a5b
13498c97390a
1426155bbcd9
151497e036ab
hexbb77c8da7

50323033511 has 2 divisors, whose sum is σ = 50323033512. Its totient is φ = 50323033510.

The previous prime is 50323033507. The next prime is 50323033513. The reversal of 50323033511 is 11533032305.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50323033511 - 22 = 50323033507 is a prime.

It is a super-6 number, since 6×503230335116 (a number of 65 digits) contains 666666 as substring.

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 250323033511 is an apocalyptic number.

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

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

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

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

Adding to 50323033511 its reverse (11533032305), we get a palindrome (61856065816).

The spelling of 50323033511 in words is "fifty billion, three hundred twenty-three million, thirty-three thousand, five hundred eleven".