Base | Representation |
---|---|
bin | 100100101111101011011101… |
… | …011101110001110001000100 |
3 | 210012012101201210210110120221 |
4 | 210233223131131301301010 |
5 | 132140223401143100202 |
6 | 1331412502010034124 |
7 | 46016442114015256 |
oct | 4457533535616104 |
9 | 705171653713527 |
10 | 161606155050052 |
11 | 47546870509999 |
12 | 16160432418944 |
13 | 6c23519b628cb |
14 | 2bc9acb485cd6 |
15 | 13a3b30eba037 |
hex | 92fadd771c44 |
161606155050052 has 12 divisors (see below), whose sum is σ = 282899510227600. Its totient is φ = 80777723556456.
The previous prime is 161606155050037. The next prime is 161606155050139. The reversal of 161606155050052 is 250050551606161.
It is a super-2 number, since 2×1616061550500522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 161606155049990 and 161606155050008.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6338477802 + ... + 6338503297.
Almost surely, 2161606155050052 is an apocalyptic number.
It is an amenable number.
161606155050052 is a deficient number, since it is larger than the sum of its proper divisors (121293355177548).
161606155050052 is a wasteful number, since it uses less digits than its factorization.
161606155050052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12676984290 (or 12676984288 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 43.
The spelling of 161606155050052 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred fifty-five million, fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •