Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0001010011000100110010 |
3 | 1110022020122111012001200212 |
4 | 2201202213301103010302 |
5 | 2423334332103223442 |
6 | 35335422250544122 |
7 | 2224010244621626 |
oct | 241424761230462 |
9 | 43266574161625 |
10 | 11101010211122 |
11 | 359aa03952637 |
12 | 12b3549a38042 |
13 | 626a89307650 |
14 | 2a5412841186 |
15 | 143b69440a82 |
hex | a18a7c53132 |
11101010211122 has 8 divisors (see below), whose sum is σ = 17932401110316. Its totient is φ = 5123543174352.
The previous prime is 11101010211047. The next prime is 11101010211131. The reversal of 11101010211122 is 22111201010111.
It can be written as a sum of positive squares in 2 ways, for example, as 7847276087401 + 3253734123721 = 2801299^2 + 1803811^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111010102111222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11101010211097 and 11101010211106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213480965573 + ... + 213480965624.
Almost surely, 211101010211122 is an apocalyptic number.
11101010211122 is a deficient number, since it is larger than the sum of its proper divisors (6831390899194).
11101010211122 is a wasteful number, since it uses less digits than its factorization.
11101010211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426961931212.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11101010211122 its reverse (22111201010111), we get a palindrome (33212211221233).
The spelling of 11101010211122 in words is "eleven trillion, one hundred one billion, ten million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •