Search a number
-
+
15050504020339 = 150131002498103
BaseRepresentation
bin1101101100000011011111…
…1100100010000101110011
31222021210222111120102210101
43123000313330202011303
53433041413012122324
652002034530013231
73112235343242314
oct333006774420563
958253874512711
1015050504020339
114882979176567
121830a7b417217
13852344521498
143a063c12660b
151b17713b8944
hexdb037f22173

15050504020339 has 4 divisors (see below), whose sum is σ = 15051506533456. Its totient is φ = 15049501507224.

The previous prime is 15050504020319. The next prime is 15050504020429. The reversal of 15050504020339 is 93302040505051.

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-15050504020339 is a prime.

It is a Duffinian number.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 215050504020339 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1002513116.

The product of its (nonzero) digits is 81000, while the sum is 37.

The spelling of 15050504020339 in words is "fifteen trillion, fifty billion, five hundred four million, twenty thousand, three hundred thirty-nine".

Divisors: 1 15013 1002498103 15050504020339