Base | Representation |
---|---|
bin | 11100001100101110… |
… | …01100101011011000 |
3 | 1110002001221111021012 |
4 | 32012113030223120 |
5 | 222001104130242 |
6 | 10542124033052 |
7 | 1044106324313 |
oct | 160627145330 |
9 | 43061844235 |
10 | 15139130072 |
11 | 646970a550 |
12 | 2b26092788 |
13 | 1573610441 |
14 | a388bd97a |
15 | 5d9148282 |
hex | 3865ccad8 |
15139130072 has 64 divisors (see below), whose sum is σ = 32197888800. Its totient is φ = 6610186240.
The previous prime is 15139130059. The next prime is 15139130107. The reversal of 15139130072 is 27003193151.
15139130072 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 487688 + ... + 517800.
Almost surely, 215139130072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15139130072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16098944400).
15139130072 is an abundant number, since it is smaller than the sum of its proper divisors (17058758728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15139130072 is a wasteful number, since it uses less digits than its factorization.
15139130072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30356 (or 30352 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 32.
The spelling of 15139130072 in words is "fifteen billion, one hundred thirty-nine million, one hundred thirty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.745 sec. • engine limits •