Base | Representation |
---|---|
bin | 11100000011010011… |
… | …00110111010100011 |
3 | 1102212120011211022021 |
4 | 32001221212322203 |
5 | 221320334220201 |
6 | 10530221322311 |
7 | 1042126324525 |
oct | 160151467243 |
9 | 42776154267 |
10 | 15060070051 |
11 | 6429020594 |
12 | 2b03706397 |
13 | 156011bb70 |
14 | a2c1bda15 |
15 | 5d222cea1 |
hex | 381a66ea3 |
15060070051 has 8 divisors (see below), whose sum is σ = 16229583104. Its totient is φ = 13892135040.
The previous prime is 15060070049. The next prime is 15060070087. The reversal of 15060070051 is 15007006051.
15060070051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15060070051 - 21 = 15060070049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15060069998 and 15060070025.
It is not an unprimeable number, because it can be changed into a prime (15060070001) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 374646 + ... + 412891.
It is an arithmetic number, because the mean of its divisors is an integer number (2028697888).
Almost surely, 215060070051 is an apocalyptic number.
15060070051 is a deficient number, since it is larger than the sum of its proper divisors (1169513053).
15060070051 is a wasteful number, since it uses less digits than its factorization.
15060070051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789021.
The product of its (nonzero) digits is 1050, while the sum is 25.
The spelling of 15060070051 in words is "fifteen billion, sixty million, seventy thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •