Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …0101101010111011110111 |
3 | 1110022021010201111110210102 |
4 | 2201202303011222323313 |
5 | 2423340224211213421 |
6 | 35335453152544315 |
7 | 2224015041641021 |
oct | 241426305527367 |
9 | 43267121443712 |
10 | 11101200101111 |
11 | 359aaa105a80a |
12 | 12b35a155209b |
13 | 626ab9761ca3 |
14 | 2a542db51011 |
15 | 143b7ae4e60b |
hex | a18b316aef7 |
11101200101111 has 8 divisors (see below), whose sum is σ = 11104651994400. Its totient is φ = 11097748520320.
The previous prime is 11101200101087. The next prime is 11101200101129. The reversal of 11101200101111 is 11110100210111.
It is a happy number.
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 11101200101111 - 210 = 11101200100087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101200101092 and 11101200101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101200101161) 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, 85041230 + ... + 85171668.
It is an arithmetic number, because the mean of its divisors is an integer number (1388081499300).
Almost surely, 211101200101111 is an apocalyptic number.
11101200101111 is a deficient number, since it is larger than the sum of its proper divisors (3451893289).
11101200101111 is a wasteful number, since it uses less digits than its factorization.
11101200101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156249.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11101200101111 its reverse (11110100210111), we get a palindrome (22211300311222).
The spelling of 11101200101111 in words is "eleven trillion, one hundred one billion, two hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •