Base | Representation |
---|---|
bin | 1010000110011000000110… |
… | …0011110010110011101011 |
3 | 1110022121002010122001200001 |
4 | 2201212001203302303223 |
5 | 2423414323002313141 |
6 | 35341225014323431 |
7 | 2224166633324221 |
oct | 241460143626353 |
9 | 43277063561601 |
10 | 11104664104171 |
11 | 35a1509430560 |
12 | 12b41a9659577 |
13 | 62721c306b41 |
14 | 2a567bc1cb11 |
15 | 143cd00eaa31 |
hex | a19818f2ceb |
11104664104171 has 4 divisors (see below), whose sum is σ = 12114179022744. Its totient is φ = 10095149185600.
The previous prime is 11104664104159. The next prime is 11104664104181. The reversal of 11104664104171 is 17140146640111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11104664104171 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11104664104171.
It is not an unprimeable number, because it can be changed into a prime (11104664104181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 504757459270 + ... + 504757459291.
It is an arithmetic number, because the mean of its divisors is an integer number (3028544755686).
Almost surely, 211104664104171 is an apocalyptic number.
11104664104171 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11104664104171 is a deficient number, since it is larger than the sum of its proper divisors (1009514918573).
11104664104171 is a wasteful number, since it uses less digits than its factorization.
11104664104171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009514918572.
The product of its (nonzero) digits is 16128, while the sum is 37.
The spelling of 11104664104171 in words is "eleven trillion, one hundred four billion, six hundred sixty-four million, one hundred four thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •