Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0010100010100101111010 |
3 | 1110022020220112012211120012 |
4 | 2201202231302202211322 |
5 | 2423340033431400442 |
6 | 35335440255301522 |
7 | 2224012612203326 |
oct | 241425562424572 |
9 | 43266815184505 |
10 | 11101111200122 |
11 | 359aa5595a119 |
12 | 12b357781a8a2 |
13 | 626aa4206358 |
14 | 2a542200c986 |
15 | 143b7323d582 |
hex | a18adca297a |
11101111200122 has 8 divisors (see below), whose sum is σ = 16651800978816. Its totient is φ = 5550510873852.
The previous prime is 11101111200103. The next prime is 11101111200149. The reversal of 11101111200122 is 22100211110111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111011112001222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11101111200097 and 11101111200106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22051988 + ... + 22549775.
It is an arithmetic number, because the mean of its divisors is an integer number (2081475122352).
Almost surely, 211101111200122 is an apocalyptic number.
11101111200122 is a deficient number, since it is larger than the sum of its proper divisors (5550689778694).
11101111200122 is a wasteful number, since it uses less digits than its factorization.
11101111200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44726212.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11101111200122 its reverse (22100211110111), we get a palindrome (33201322310233).
The spelling of 11101111200122 in words is "eleven trillion, one hundred one billion, one hundred eleven million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •