Search a number
-
+
15012750070 = 251501275007
BaseRepresentation
bin11011111101101010…
…00110001011110110
31102202021010201111101
431332311012023312
5221221231000240
610521411200314
71041013161433
oct157665061366
942667121441
1015012750070
11640434036a
122aab8a609a
131553391586
14a25bc2b8a
155cced239a
hex37ed462f6

15012750070 has 8 divisors (see below), whose sum is σ = 27022950144. Its totient is φ = 6005100024.

The previous prime is 15012750059. The next prime is 15012750083. The reversal of 15012750070 is 7005721051.

It is a sphenic number, since it is the product of 3 distinct primes.

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, 750637494 + ... + 750637513.

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

Almost surely, 215012750070 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1501275014.

The product of its (nonzero) digits is 2450, while the sum is 28.

The spelling of 15012750070 in words is "fifteen billion, twelve million, seven hundred fifty thousand, seventy".

Divisors: 1 2 5 10 1501275007 3002550014 7506375035 15012750070