Base | Representation |
---|---|
bin | 1001000101100110100… |
… | …1011001100101110101 |
3 | 112220222110200101210002 |
4 | 2101121221121211311 |
5 | 10024214422110410 |
6 | 155415530241045 |
7 | 14164604210624 |
oct | 2213151314565 |
9 | 486873611702 |
10 | 156122847605 |
11 | 6023630618a |
12 | 26311286185 |
13 | 11950c2b2ca |
14 | 77b0a1b6bb |
15 | 40db3d17a5 |
hex | 2459a59975 |
156122847605 has 16 divisors (see below), whose sum is σ = 191353052160. Its totient is φ = 122228397312.
The previous prime is 156122847557. The next prime is 156122847641. The reversal of 156122847605 is 506748221651.
156122847605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-156122847605 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a self number, because there is not a number n which added to its sum of digits gives 156122847605.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2765501 + ... + 2821389.
It is an arithmetic number, because the mean of its divisors is an integer number (11959565760).
Almost surely, 2156122847605 is an apocalyptic number.
It is an amenable number.
156122847605 is a deficient number, since it is larger than the sum of its proper divisors (35230204555).
156122847605 is a wasteful number, since it uses less digits than its factorization.
156122847605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67828.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 156122847605 in words is "one hundred fifty-six billion, one hundred twenty-two million, eight hundred forty-seven thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •