Search a number
-
+
5113541051 is a prime number
BaseRepresentation
bin1001100001100101…
…00111000110111011
3111012101000210121022
410300302213012323
540433031303201
62203224533055
7240501244643
oct46062470673
914171023538
105113541051
112194508093
12ba862118b
13636533948
143671b9523
151eddd341b
hex130ca71bb

5113541051 has 2 divisors, whose sum is σ = 5113541052. Its totient is φ = 5113541050.

The previous prime is 5113541039. The next prime is 5113541053. The reversal of 5113541051 is 1501453115.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5113541051 - 210 = 5113540027 is a prime.

It is a super-2 number, since 2×51135410512 = 52296604160524369202, which contains 22 as substring.

Together with 5113541053, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 25113541051 is an apocalyptic number.

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

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

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

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

The square root of 5113541051 is about 71509.0277587383. The cubic root of 5113541051 is about 1722.8226874749.

Adding to 5113541051 its reverse (1501453115), we get a palindrome (6614994166).

The spelling of 5113541051 in words is "five billion, one hundred thirteen million, five hundred forty-one thousand, fifty-one".