Base | Representation |
---|---|
bin | 1010000111010010000000… |
… | …1110111101010000111011 |
3 | 1110101002012122002100122222 |
4 | 2201310200032331100323 |
5 | 2424143143021334321 |
6 | 35352315433034255 |
7 | 2225260124642423 |
oct | 241644016752073 |
9 | 43332178070588 |
10 | 11120211121211 |
11 | 35a8067302575 |
12 | 12b720825598b |
13 | 62882928a6ca |
14 | 2a6314957483 |
15 | 1443dee643ab |
hex | a1d203bd43b |
11120211121211 has 8 divisors (see below), whose sum is σ = 11479890422784. Its totient is φ = 10760591995560.
The previous prime is 11120211121199. The next prime is 11120211121249. The reversal of 11120211121211 is 11212111202111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11120211121211 - 26 = 11120211121147 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 11120211121211.
It is not an unprimeable number, because it can be changed into a prime (11120211123211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14668265 + ... + 15407738.
It is an arithmetic number, because the mean of its divisors is an integer number (1434986302848).
Almost surely, 211120211121211 is an apocalyptic number.
11120211121211 is a deficient number, since it is larger than the sum of its proper divisors (359679301573).
11120211121211 is a wasteful number, since it uses less digits than its factorization.
11120211121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30087961.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11120211121211 its reverse (11212111202111), we get a palindrome (22332322323322).
The spelling of 11120211121211 in words is "eleven trillion, one hundred twenty billion, two hundred eleven million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •