Base | Representation |
---|---|
bin | 100101110000001111000011… |
… | …101001001010111000011101 |
3 | 210202220111111221200121102112 |
4 | 211300033003221022320131 |
5 | 133230414340244430121 |
6 | 1345050500333203405 |
7 | 46655112013552061 |
oct | 4560170351127035 |
9 | 722814457617375 |
10 | 166042423045661 |
11 | 489a7218101848 |
12 | 16758173630565 |
13 | 718596c100bb6 |
14 | 2d006d3643aa1 |
15 | 142e2278bb75b |
hex | 9703c3a4ae1d |
166042423045661 has 8 divisors (see below), whose sum is σ = 166816020672000. Its totient is φ = 165269084462352.
The previous prime is 166042423045637. The next prime is 166042423045673. The reversal of 166042423045661 is 166540324240661.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 166042423045661 - 222 = 166042418851357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166042423047661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63475745 + ... + 66039798.
It is an arithmetic number, because the mean of its divisors is an integer number (20852002584000).
Almost surely, 2166042423045661 is an apocalyptic number.
It is an amenable number.
166042423045661 is a deficient number, since it is larger than the sum of its proper divisors (773597626339).
166042423045661 is a wasteful number, since it uses less digits than its factorization.
166042423045661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129521515.
The product of its (nonzero) digits is 4976640, while the sum is 50.
The spelling of 166042423045661 in words is "one hundred sixty-six trillion, forty-two billion, four hundred twenty-three million, forty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •