Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …0111001010100011100010 |
3 | 1102222201221200122222010121 |
4 | 2200033233213022203202 |
5 | 2420410104411413442 |
6 | 35230504103350454 |
7 | 2214410102541034 |
oct | 240175747124342 |
9 | 42881850588117 |
10 | 11012021201122 |
11 | 3566198981277 |
12 | 129a25375242a |
13 | 61b576a9c906 |
14 | 2a0dadd11c54 |
15 | 1416abc16967 |
hex | a03ef9ca8e2 |
11012021201122 has 8 divisors (see below), whose sum is σ = 16519782177756. Its totient is φ = 5505427141872.
The previous prime is 11012021201107. The next prime is 11012021201149. The reversal of 11012021201122 is 22110212021011.
11012021201122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9378177389161 + 1633843811961 = 3062381^2 + 1278219^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110120212011222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11012021201096 and 11012021201105.
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, 291705753 + ... + 291743500.
Almost surely, 211012021201122 is an apocalyptic number.
11012021201122 is a deficient number, since it is larger than the sum of its proper divisors (5507760976634).
11012021201122 is an equidigital number, since it uses as much as digits as its factorization.
11012021201122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 583458692.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11012021201122 its reverse (22110212021011), we get a palindrome (33122233222133).
The spelling of 11012021201122 in words is "eleven trillion, twelve billion, twenty-one million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •