Base | Representation |
---|---|
bin | 10110101010000100… |
… | …11011101001110100 |
3 | 1011101201221021111201 |
4 | 23111002123221310 |
5 | 144403003303111 |
6 | 5331011142244 |
7 | 610303210150 |
oct | 132502335164 |
9 | 34351837451 |
10 | 12164119156 |
11 | 5182367842 |
12 | 24358a4984 |
13 | 11bb168157 |
14 | 835740060 |
15 | 4b2d8d6c1 |
hex | 2d509ba74 |
12164119156 has 48 divisors (see below), whose sum is σ = 25004238336. Its totient is φ = 5069411424.
The previous prime is 12164119127. The next prime is 12164119169. The reversal of 12164119156 is 65191146121.
It is a happy number.
12164119156 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, 251055 + ... + 295561.
It is an arithmetic number, because the mean of its divisors is an integer number (520921632).
Almost surely, 212164119156 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 12164119156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12502119168).
12164119156 is an abundant number, since it is smaller than the sum of its proper divisors (12840119180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12164119156 is a wasteful number, since it uses less digits than its factorization.
12164119156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44788 (or 44786 counting only the distinct ones).
The product of its digits is 12960, while the sum is 37.
The spelling of 12164119156 in words is "twelve billion, one hundred sixty-four million, one hundred nineteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •