15047106430132 has 12 divisors (see below), whose sum is σ = 30094212860320. Its totient is φ = 6448759898616.

The previous prime is 15047106430063. The next prime is 15047106430189. The reversal of 15047106430132 is 23103460174051.

It is a happy number.

15047106430132 is an admirable number.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 2^{15047106430132} is an apocalyptic number.

It is an amenable number.

15047106430132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 537396658230 (or 537396658228 counting only the distinct ones).

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

The spelling of 15047106430132 in words is "fifteen trillion, forty-seven billion, one hundred six million, four hundred thirty thousand, one hundred thirty-two".