Search a number
-
+
50555061493 is a prime number
BaseRepresentation
bin101111000101010100…
…010000010011110101
311211111021021012211221
4233011110100103311
51312014043431433
635120310230341
73436541634556
oct570524202365
9154437235757
1050555061493
111a493017a62
12996a9553b1
1349c8a62c91
14263833a32d
1514ad48772d
hexbc55104f5

50555061493 has 2 divisors, whose sum is σ = 50555061494. Its totient is φ = 50555061492.

The previous prime is 50555061457. The next prime is 50555061503. The reversal of 50555061493 is 39416055505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 39767538724 + 10787522769 = 199418^2 + 103863^2 .

It is a cyclic number.

It is not a de Polignac number, because 50555061493 - 29 = 50555060981 is a prime.

It is a super-2 number, since 2×505550614932 (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 (50555061793) by changing a digit.

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

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

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

Almost surely, 250555061493 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 405000, while the sum is 43.

The spelling of 50555061493 in words is "fifty billion, five hundred fifty-five million, sixty-one thousand, four hundred ninety-three".