Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110111101110011101000 |
3 | 1110022020121212020211000011 |
4 | 2201202213032331303220 |
5 | 2423334322302223422 |
6 | 35335421330021304 |
7 | 2224010105255551 |
oct | 241424716756350 |
9 | 43266555224004 |
10 | 11101001211112 |
11 | 359a9a986580a |
12 | 12b3546a17834 |
13 | 626a874a5cb7 |
14 | 2a541157b328 |
15 | 143b68764077 |
hex | a18a73bdce8 |
11101001211112 has 16 divisors (see below), whose sum is σ = 20952220831200. Its totient is φ = 5513742322800.
The previous prime is 11101001211107. The next prime is 11101001211149. The reversal of 11101001211112 is 21111210010111.
It is a super-3 number, since 3×111010012111123 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11101001211092 and 11101001211101.
It is an unprimeable number.
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, 4594784062 + ... + 4594786477.
It is an arithmetic number, because the mean of its divisors is an integer number (1309513801950).
Almost surely, 211101001211112 is an apocalyptic number.
It is an amenable number.
11101001211112 is a deficient number, since it is larger than the sum of its proper divisors (9851219620088).
11101001211112 is a wasteful number, since it uses less digits than its factorization.
11101001211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9189570696 (or 9189570692 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11101001211112 its reverse (21111210010111), we get a palindrome (32212211221223).
The spelling of 11101001211112 in words is "eleven trillion, one hundred one billion, one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •