Search a number
-
+
5015202315131 = 24095920813509
BaseRepresentation
bin100100011111011000101…
…0110100011101101111011
3122202110010001221202021202
41020332301112203231323
51124132113243041011
614355541354524415
71025223250210451
oct110766126435573
918673101852252
105015202315131
111663a31a62968
1268bb9113670b
132a4c157c82c8
14134a467d29d1
158a6cc19b23b
hex48fb15a3b7b

5015202315131 has 4 divisors (see below), whose sum is σ = 5015223369600. Its totient is φ = 5015181260664.

The previous prime is 5015202315089. The next prime is 5015202315163. The reversal of 5015202315131 is 1315132025105.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a super-2 number, since 2×50152023151312 (a number of 26 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (5015202314131) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10165796 + ... + 10647713.

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

Almost surely, 25015202315131 is an apocalyptic number.

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

5015202315131 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 21054468.

The product of its (nonzero) digits is 4500, while the sum is 29.

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

Divisors: 1 240959 20813509 5015202315131