Search a number
-
+
5301115051 is a prime number
BaseRepresentation
bin1001110111111100…
…01001100010101011
3111200102222112202111
410323332021202223
541324041140201
62234005143151
7245236506631
oct47376114253
914612875674
105301115051
112280383221
12103b3baab7
1366635a08b
14384085351
152105d5b51
hex13bf898ab

5301115051 has 2 divisors, whose sum is σ = 5301115052. Its totient is φ = 5301115050.

The previous prime is 5301115009. The next prime is 5301115073. The reversal of 5301115051 is 1505111035.

It is an a-pointer prime, because the next prime (5301115073) can be obtained adding 5301115051 to its sum of digits (22).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5301115051 - 211 = 5301113003 is a prime.

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

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

Almost surely, 25301115051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 375, while the sum is 22.

The square root of 5301115051 is about 72808.7566917606. The cubic root of 5301115051 is about 1743.6356635318.

Adding to 5301115051 its reverse (1505111035), we get a palindrome (6806226086).

The spelling of 5301115051 in words is "five billion, three hundred one million, one hundred fifteen thousand, fifty-one".