Base | Representation |
---|---|
bin | 100101101001001110110101… |
… | …100110001111100010110010 |
3 | 210201012111021021112121100010 |
4 | 211221032311212033202302 |
5 | 133200023214132411041 |
6 | 1344041424240235350 |
7 | 46605253443304632 |
oct | 4551166546174262 |
9 | 721174237477303 |
10 | 165561151060146 |
11 | 488310a966a876 |
12 | 1669aa3a60bb56 |
13 | 714c470c810ca |
14 | 2cc52b97d86c2 |
15 | 142195aee9a16 |
hex | 9693b598f8b2 |
165561151060146 has 16 divisors (see below), whose sum is σ = 332580990678624. Its totient is φ = 54943935593664.
The previous prime is 165561151060049. The next prime is 165561151060169. The reversal of 165561151060146 is 641060151165561.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 165561151060095 and 165561151060104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60778688455 + ... + 60778691178.
It is an arithmetic number, because the mean of its divisors is an integer number (20786311917414).
Almost surely, 2165561151060146 is an apocalyptic number.
165561151060146 is an abundant number, since it is smaller than the sum of its proper divisors (167019839618478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165561151060146 is a wasteful number, since it uses less digits than its factorization.
165561151060146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121557379865.
The product of its (nonzero) digits is 648000, while the sum is 48.
The spelling of 165561151060146 in words is "one hundred sixty-five trillion, five hundred sixty-one billion, one hundred fifty-one million, sixty thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •