Search a number
-
+
50032730569 is a prime number
BaseRepresentation
bin101110100110001011…
…101110000111001001
311210010212102001112011
4232212023232013021
51304431334334234
634552411015521
73420600123103
oct564613560711
9153125361464
1050032730569
111a245199008
129843a3a5a1
13494478c823
1425c8c10573
15147c6acb64
hexba62ee1c9

50032730569 has 2 divisors, whose sum is σ = 50032730570. Its totient is φ = 50032730568.

The previous prime is 50032730471. The next prime is 50032730603. The reversal of 50032730569 is 96503723005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25635852544 + 24396878025 = 160112^2 + 156195^2 .

It is a cyclic number.

It is not a de Polignac number, because 50032730569 - 29 = 50032730057 is a prime.

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

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

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

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

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

Almost surely, 250032730569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 170100, while the sum is 40.

The spelling of 50032730569 in words is "fifty billion, thirty-two million, seven hundred thirty thousand, five hundred sixty-nine".