Base | Representation |
---|---|
bin | 100101100011011111011001… |
… | …000111100100010000010101 |
3 | 210122210202220000221110201101 |
4 | 211203133121013210100111 |
5 | 133122042204130211221 |
6 | 1343140254304230101 |
7 | 46534615365553015 |
oct | 4543373107442025 |
9 | 718722800843641 |
10 | 165166610007061 |
11 | 48699847512053 |
12 | 1663648b60b331 |
13 | 71211b55b1790 |
14 | 2cb016c643c45 |
15 | 14165689b1d91 |
hex | 9637d91e4415 |
165166610007061 has 16 divisors (see below), whose sum is σ = 178480866614400. Its totient is φ = 151939384395840.
The previous prime is 165166610007037. The next prime is 165166610007073. The reversal of 165166610007061 is 160700016661561.
It is a cyclic number.
It is not a de Polignac number, because 165166610007061 - 27 = 165166610006933 is a prime.
It is a super-2 number, since 2×1651666100070612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165166610007361) 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 15 ways as a sum of consecutive naturals, for example, 423636390 + ... + 424026088.
It is an arithmetic number, because the mean of its divisors is an integer number (11155054163400).
Almost surely, 2165166610007061 is an apocalyptic number.
It is an amenable number.
165166610007061 is a deficient number, since it is larger than the sum of its proper divisors (13314256607339).
165166610007061 is a wasteful number, since it uses less digits than its factorization.
165166610007061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501276.
The product of its (nonzero) digits is 272160, while the sum is 46.
The spelling of 165166610007061 in words is "one hundred sixty-five trillion, one hundred sixty-six billion, six hundred ten million, seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •