Search a number
-
+
50110274051 is a prime number
BaseRepresentation
bin101110101010110011…
…100001101000000011
311210100021022200011222
4232222303201220003
51310111212232201
635004221025255
73422531205305
oct565263415003
9153307280158
1050110274051
111a284a41632
1298659b522b
13495786ca46
1425d5237975
1514843c891b
hexbaace1a03

50110274051 has 2 divisors, whose sum is σ = 50110274052. Its totient is φ = 50110274050.

The previous prime is 50110273963. The next prime is 50110274063. The reversal of 50110274051 is 15047201105.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50110274051 is a prime.

It is a super-2 number, since 2×501102740512 (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 50110274051.

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

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

Almost surely, 250110274051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1400, while the sum is 26.

Adding to 50110274051 its reverse (15047201105), we get a palindrome (65157475156).

The spelling of 50110274051 in words is "fifty billion, one hundred ten million, two hundred seventy-four thousand, fifty-one".