Base | Representation |
---|---|
bin | 1010001100100100111110… |
… | …0110011010011010110111 |
3 | 1110200210001210221000112022 |
4 | 2203021033212122122313 |
5 | 2432141014212043221 |
6 | 35502204302543355 |
7 | 2234660663416103 |
oct | 243111746323267 |
9 | 43623053830468 |
10 | 11211200112311 |
11 | 3632709208281 |
12 | 1310980297b5b |
13 | 634299c64004 |
14 | 2aa8a6d38903 |
15 | 14696804a4ab |
hex | a324f99a6b7 |
11211200112311 has 8 divisors (see below), whose sum is σ = 11231054996304. Its totient is φ = 11191346000640.
The previous prime is 11211200112293. The next prime is 11211200112313. The reversal of 11211200112311 is 11321100211211.
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 11211200112311 - 234 = 11194020243127 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 11211200112311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211200112313) 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, 34310375 + ... + 34635591.
It is an arithmetic number, because the mean of its divisors is an integer number (1403881874538).
Almost surely, 211211200112311 is an apocalyptic number.
11211200112311 is a deficient number, since it is larger than the sum of its proper divisors (19854883993).
11211200112311 is an equidigital number, since it uses as much as digits as its factorization.
11211200112311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 386161.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11211200112311 its reverse (11321100211211), we get a palindrome (22532300323522).
The spelling of 11211200112311 in words is "eleven trillion, two hundred eleven billion, two hundred million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •