Search a number
-
+
15107531040 = 253257373419
BaseRepresentation
bin11100001000111101…
…01010000100100000
31102222212111002112200
432010132222010200
5221420011443130
610535034453200
71043243616000
oct160436520440
942885432480
1015107531040
116452897748
122b17594200
131569bc86a4
14a34616000
155d64a5760
hex3847aa120

15107531040 has 576 divisors, whose sum is σ = 61090848000. Its totient is φ = 3397718016.

The previous prime is 15107531039. The next prime is 15107531081. The reversal of 15107531040 is 4013570151.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 36055951 + ... + 36056369.

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

Almost surely, 215107531040 is an apocalyptic number.

15107531040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 15107531040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30545424000).

15107531040 is an abundant number, since it is smaller than the sum of its proper divisors (45983316960).

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

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

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

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

The product of its (nonzero) digits is 2100, while the sum is 27.

The spelling of 15107531040 in words is "fifteen billion, one hundred seven million, five hundred thirty-one thousand, forty".