Search a number
-
+
50055550291 is a prime number
BaseRepresentation
bin101110100111100010…
…110001010101010011
311210012110100102022001
4232213202301111103
51310003210102131
634554544054431
73421265104645
oct564742612523
9153173312261
1050055550291
111a25706488a
12984b604417
13494941c516
1425cbc70895
15147e6b9261
hexba78b1553

50055550291 has 2 divisors, whose sum is σ = 50055550292. Its totient is φ = 50055550290.

The previous prime is 50055550283. The next prime is 50055550343. The reversal of 50055550291 is 19205555005.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50055550291 - 23 = 50055550283 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 50055550291.

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

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

Almost surely, 250055550291 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56250, while the sum is 37.

The spelling of 50055550291 in words is "fifty billion, fifty-five million, five hundred fifty thousand, two hundred ninety-one".