Base | Representation |
---|---|
bin | 111101100111100000… |
… | …110000101000101001 |
3 | 20022202212212200100200 |
4 | 331213200300220221 |
5 | 2040444223304010 |
6 | 50221035022413 |
7 | 4531351333422 |
oct | 754740605051 |
9 | 208685780320 |
10 | 66161150505 |
11 | 2607127668a |
12 | 109a529aa09 |
13 | 631502a288 |
14 | 32b8c50649 |
15 | 1ac35bdcc0 |
hex | f67830a29 |
66161150505 has 24 divisors (see below), whose sum is σ = 115222848000. Its totient is φ = 35118709920.
The previous prime is 66161150479. The next prime is 66161150513. The reversal of 66161150505 is 50505116166.
It is not a de Polignac number, because 66161150505 - 26 = 66161150441 is a prime.
It is a super-2 number, since 2×661611505052 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 66161150505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3474505 + ... + 3493494.
It is an arithmetic number, because the mean of its divisors is an integer number (4800952000).
Almost surely, 266161150505 is an apocalyptic number.
It is an amenable number.
66161150505 is a deficient number, since it is larger than the sum of its proper divisors (49061697495).
66161150505 is a wasteful number, since it uses less digits than its factorization.
66161150505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6968221 (or 6968218 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 66161150505 in words is "sixty-six billion, one hundred sixty-one million, one hundred fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •