Base | Representation |
---|---|
bin | 1010001101001001110110… |
… | …1011011111011101100010 |
3 | 1110201201121202022110220212 |
4 | 2203102131223133131202 |
5 | 2432321303100013442 |
6 | 35510522511534122 |
7 | 2235461214163514 |
oct | 243223553373542 |
9 | 43651552273825 |
10 | 11221100001122 |
11 | 3636929465270 |
12 | 131288382a342 |
13 | 6351b6c9c19b |
14 | 2ab165a7bbb4 |
15 | 146d47230a82 |
hex | a349dadf762 |
11221100001122 has 8 divisors (see below), whose sum is σ = 18361800001872. Its totient is φ = 5100500000500.
The previous prime is 11221100001119. The next prime is 11221100001143. The reversal of 11221100001122 is 22110000112211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×112211000011223 (a number of 40 digits) contains 333 as substring.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 11221100001097 and 11221100001106.
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, 255025000004 + ... + 255025000047.
It is an arithmetic number, because the mean of its divisors is an integer number (2295225000234).
Almost surely, 211221100001122 is an apocalyptic number.
11221100001122 is a deficient number, since it is larger than the sum of its proper divisors (7140700000750).
11221100001122 is a wasteful number, since it uses less digits than its factorization.
11221100001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510050000064.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11221100001122 its reverse (22110000112211), we get a palindrome (33331100113333).
It can be divided in two parts, 11 and 221100001122, that multiplied together give a palindrome (2432100012342).
The spelling of 11221100001122 in words is "eleven trillion, two hundred twenty-one billion, one hundred million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •