Base | Representation |
---|---|
bin | 11100100000001001… |
… | …01100000101110100 |
3 | 1110111102111200121200 |
4 | 32100010230011310 |
5 | 222314311101124 |
6 | 11010224012500 |
7 | 1051125165102 |
oct | 162004540564 |
9 | 43442450550 |
10 | 15302050164 |
11 | 6542676855 |
12 | 2b70761130 |
13 | 159b2b406b |
14 | a523acc72 |
15 | 5e85cabc9 |
hex | 39012c174 |
15302050164 has 18 divisors (see below), whose sum is σ = 38680182450. Its totient is φ = 5100683376.
The previous prime is 15302050163. The next prime is 15302050171. The reversal of 15302050164 is 46105020351.
15302050164 is a `hidden beast` number, since 1 + 530 + 20 + 50 + 1 + 64 = 666.
It can be written as a sum of positive squares in only one way, i.e., 12690022500 + 2612027664 = 112650^2 + 51108^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15302050163) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 212528439 + ... + 212528510.
It is an arithmetic number, because the mean of its divisors is an integer number (2148899025).
Almost surely, 215302050164 is an apocalyptic number.
It is an amenable number.
15302050164 is an abundant number, since it is smaller than the sum of its proper divisors (23378132286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15302050164 is a wasteful number, since it uses less digits than its factorization.
15302050164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425056959 (or 425056954 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 15302050164 in words is "fifteen billion, three hundred two million, fifty thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •