Search a number
-
+
50550530477 is a prime number
BaseRepresentation
bin101111000101000010…
…111110000110101101
311211110221202000110112
4233011002332012231
51312011413433402
635120025145405
73436455263606
oct570502760655
9154427660415
1050550530477
111a490502817
12996932b265
1349c7b377c5
1426378badad
1514acd8ee52
hexbc50be1ad

50550530477 has 2 divisors, whose sum is σ = 50550530478. Its totient is φ = 50550530476.

The previous prime is 50550530453. The next prime is 50550530497. The reversal of 50550530477 is 77403505505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 44358256996 + 6192273481 = 210614^2 + 78691^2 .

It is a cyclic number.

It is not a de Polignac number, because 50550530477 - 28 = 50550530221 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50550530417) 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, 25275265238 + 25275265239.

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

Almost surely, 250550530477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 367500, while the sum is 41.

The spelling of 50550530477 in words is "fifty billion, five hundred fifty million, five hundred thirty thousand, four hundred seventy-seven".