Base | Representation |
---|---|
bin | 100101101010101101110011… |
… | …000000100100101011111001 |
3 | 210201120020110012010002221012 |
4 | 211222231303000210223321 |
5 | 133203211023423312441 |
6 | 1344200330012523305 |
7 | 46615523243342153 |
oct | 4552556300445371 |
9 | 721506405102835 |
10 | 165663113104121 |
11 | 48870371578616 |
12 | 166b6755480535 |
13 | 7158c701087c9 |
14 | 2cca1cd273ad3 |
15 | 14244275ea9eb |
hex | 96ab73024af9 |
165663113104121 has 8 divisors (see below), whose sum is σ = 165945812954880. Its totient is φ = 165380445421488.
The previous prime is 165663113104081. The next prime is 165663113104157. The reversal of 165663113104121 is 121401311366561.
165663113104121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165663113104121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165663163104121) 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, 2277875 + ... + 18344343.
It is an arithmetic number, because the mean of its divisors is an integer number (20743226619360).
Almost surely, 2165663113104121 is an apocalyptic number.
It is an amenable number.
165663113104121 is a deficient number, since it is larger than the sum of its proper divisors (282699850759).
165663113104121 is a wasteful number, since it uses less digits than its factorization.
165663113104121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16084063.
The product of its (nonzero) digits is 77760, while the sum is 41.
The spelling of 165663113104121 in words is "one hundred sixty-five trillion, six hundred sixty-three billion, one hundred thirteen million, one hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •