Search a number
-
+
5015130315737 is a prime number
BaseRepresentation
bin100100011111010110100…
…0011111001101111011001
3122202102221001110210200112
41020332231003321233121
51124131441330100422
614355530303414105
71025221414215623
oct110765503715731
918672831423615
105015130315737
1116639a5356733
1268bb70bb4335
132a4c03909709
14134a3b00dc13
158a6c5bc7ee2
hex48fad0f9bd9

5015130315737 has 2 divisors, whose sum is σ = 5015130315738. Its totient is φ = 5015130315736.

The previous prime is 5015130315709. The next prime is 5015130315739. The reversal of 5015130315737 is 7375130315105.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4416171957961 + 598958357776 = 2101469^2 + 773924^2 .

It is a cyclic number.

It is not a de Polignac number, because 5015130315737 - 26 = 5015130315673 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 5015130315694 and 5015130315703.

It is not a weakly prime, because it can be changed into another prime (5015130315739) by changing a digit.

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

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

Almost surely, 25015130315737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 165375, while the sum is 41.

The spelling of 5015130315737 in words is "five trillion, fifteen billion, one hundred thirty million, three hundred fifteen thousand, seven hundred thirty-seven".