Base | Representation |
---|---|
bin | 1010100110110001000001… |
… | …1000101010110111111110 |
3 | 1112021210100212211211112021 |
4 | 2221230100120222313332 |
5 | 3012023423421024131 |
6 | 40445012425030354 |
7 | 2312326130000236 |
oct | 251542030526776 |
9 | 45253325754467 |
10 | 11661111111166 |
11 | 37964a4243860 |
12 | 13840026253ba |
13 | 66783aa7c96a |
14 | 2c4587aa0cc6 |
15 | 1534eb5a7e11 |
hex | a9b1062adfe |
11661111111166 has 8 divisors (see below), whose sum is σ = 19081818181944. Its totient is φ = 5300505050520.
The previous prime is 11661111111163. The next prime is 11661111111193. The reversal of 11661111111166 is 66111111116611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11661111111161) 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 3 ways as a sum of consecutive naturals, for example, 265025252505 + ... + 265025252548.
It is an arithmetic number, because the mean of its divisors is an integer number (2385227272743).
Almost surely, 211661111111166 is an apocalyptic number.
11661111111166 is a deficient number, since it is larger than the sum of its proper divisors (7420707070778).
11661111111166 is a wasteful number, since it uses less digits than its factorization.
11661111111166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530050505066.
The product of its digits is 1296, while the sum is 34.
Adding to 11661111111166 its reverse (66111111116611), we get a palindrome (77772222227777).
Subtracting 11661111111166 from its reverse (66111111116611), we obtain a palindrome (54450000005445).
The spelling of 11661111111166 in words is "eleven trillion, six hundred sixty-one billion, one hundred eleven million, one hundred eleven thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •