Search a number
-
+
50166503113 is a prime number
BaseRepresentation
bin101110101110001010…
…000001011011001001
311210111012010101221211
4232232022001123021
51310220111044423
635013550133121
73424113145366
oct565612013311
9153435111854
1050166503113
111a303757331
1298807b11a1
1349663c948c
1425dc8b346d
1514892d410d
hexbae2816c9

50166503113 has 2 divisors, whose sum is σ = 50166503114. Its totient is φ = 50166503112.

The previous prime is 50166503087. The next prime is 50166503131. The reversal of 50166503113 is 31130566105.

Together with next prime (50166503131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 33989715769 + 16176787344 = 184363^2 + 127188^2 .

It is a cyclic number.

It is not a de Polignac number, because 50166503113 - 25 = 50166503081 is a prime.

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

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

Almost surely, 250166503113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 31.

The spelling of 50166503113 in words is "fifty billion, one hundred sixty-six million, five hundred three thousand, one hundred thirteen".