Search a number
-
+
15106748579029 = 145310396936393
BaseRepresentation
bin1101101111010101000001…
…1000011111110011010101
31222111012011021122001112201
43123311100120133303111
53440002110114012104
652043540002044501
73116266212143452
oct333652030376325
958435137561481
1015106748579029
1148a4810816a18
12183b957649731
13857738c15a43
143a3255d26829
151b2e640a30a4
hexdbd5061fcd5

15106748579029 has 4 divisors (see below), whose sum is σ = 15117145516876. Its totient is φ = 15096351641184.

The previous prime is 15106748578991. The next prime is 15106748579093. The reversal of 15106748579029 is 92097584760151.

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

It can be written as a sum of positive squares in 2 ways, for example, as 10764534474225 + 4342214104804 = 3280935^2 + 2083798^2 .

It is a cyclic number.

It is not a de Polignac number, because 15106748579029 - 211 = 15106748576981 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15106748579129) 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, 5198466744 + ... + 5198469649.

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

Almost surely, 215106748579029 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10396937846.

The product of its (nonzero) digits is 38102400, while the sum is 64.

The spelling of 15106748579029 in words is "fifteen trillion, one hundred six billion, seven hundred forty-eight million, five hundred seventy-nine thousand, twenty-nine".

Divisors: 1 1453 10396936393 15106748579029