Base | Representation |
---|---|
bin | 100100101111101011011101… |
… | …011101110001110001000011 |
3 | 210012012101201210210110120220 |
4 | 210233223131131301301003 |
5 | 132140223401143100201 |
6 | 1331412502010034123 |
7 | 46016442114015255 |
oct | 4457533535616103 |
9 | 705171653713526 |
10 | 161606155050051 |
11 | 47546870509998 |
12 | 16160432418943 |
13 | 6c23519b628ca |
14 | 2bc9acb485cd5 |
15 | 13a3b30eba036 |
hex | 92fadd771c43 |
161606155050051 has 8 divisors (see below), whose sum is σ = 215498892483264. Its totient is φ = 107725427158440.
The previous prime is 161606155050037. The next prime is 161606155050139. The reversal of 161606155050051 is 150050551606161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161606155050051 - 219 = 161606154525763 is a prime.
It is a super-2 number, since 2×1616061550500512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 161606155049985 and 161606155050012.
It is not an unprimeable number, because it can be changed into a prime (161606155050031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3002354001 + ... + 3002407826.
It is an arithmetic number, because the mean of its divisors is an integer number (26937361560408).
Almost surely, 2161606155050051 is an apocalyptic number.
161606155050051 is a deficient number, since it is larger than the sum of its proper divisors (53892737433213).
161606155050051 is an equidigital number, since it uses as much as digits as its factorization.
161606155050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6004770801.
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 161606155050051 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred fifty-five million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •