Base | Representation |
---|---|
bin | 10010101000100… |
… | …10110110101100 |
3 | 101220010121221101 |
4 | 21110102312230 |
5 | 310004040202 |
6 | 23302212444 |
7 | 3605441005 |
oct | 1124226654 |
9 | 356117841 |
10 | 156315052 |
11 | 802658a3 |
12 | 44424124 |
13 | 2650041a |
14 | 16a901ac |
15 | daca887 |
hex | 9512dac |
156315052 has 12 divisors (see below), whose sum is σ = 287948920. Its totient is φ = 74043936.
The previous prime is 156315043. The next prime is 156315053. The reversal of 156315052 is 250513651.
It is a self number, because there is not a number n which added to its sum of digits gives 156315052.
It is not an unprimeable number, because it can be changed into a prime (156315053) 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 3 ways as a sum of consecutive naturals, for example, 1028313 + ... + 1028464.
Almost surely, 2156315052 is an apocalyptic number.
It is an amenable number.
156315052 is a deficient number, since it is larger than the sum of its proper divisors (131633868).
156315052 is a wasteful number, since it uses less digits than its factorization.
156315052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2056800 (or 2056798 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 156315052 is about 12502.6018092236. The cubic root of 156315052 is about 538.6834089561.
The spelling of 156315052 in words is "one hundred fifty-six million, three hundred fifteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •