Base | Representation |
---|---|
bin | 100100101111101011010111… |
… | …111001010110101110110111 |
3 | 210012012101111021222112020112 |
4 | 210233223113321112232313 |
5 | 132140223203233203210 |
6 | 1331412444431253235 |
7 | 46016436600601040 |
oct | 4457532771265667 |
9 | 705171437875215 |
10 | 161606061616055 |
11 | 475468227a2611 |
12 | 1616040707a21b |
13 | 6c235036aa914 |
14 | 2bc9abccc38c7 |
15 | 13a3b27bb0d05 |
hex | 92fad7e56bb7 |
161606061616055 has 16 divisors (see below), whose sum is σ = 221631493373760. Its totient is φ = 110815423529472.
The previous prime is 161606061616033. The next prime is 161606061616157. The reversal of 161606061616055 is 550616160606161.
It is a cyclic number.
It is not a de Polignac number, because 161606061616055 - 234 = 161588881746871 is a prime.
It is a super-2 number, since 2×1616060616160552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 161606061615994 and 161606061616012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24148301 + ... + 30105689.
It is an arithmetic number, because the mean of its divisors is an integer number (13851968335860).
Almost surely, 2161606061616055 is an apocalyptic number.
161606061616055 is a deficient number, since it is larger than the sum of its proper divisors (60025431757705).
161606061616055 is an equidigital number, since it uses as much as digits as its factorization.
161606061616055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6732458.
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 161606061616055 in words is "one hundred sixty-one trillion, six hundred six billion, sixty-one million, six hundred sixteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •