Base | Representation |
---|---|
bin | 1010000110000111100010… |
… | …1010111000011101111010 |
3 | 1110022011121102021011222210 |
4 | 2201201320222320131322 |
5 | 2423331222310000442 |
6 | 35335212021555550 |
7 | 2223651541135521 |
oct | 241417052703572 |
9 | 43264542234883 |
10 | 11100220000122 |
11 | 359a6388983a0 |
12 | 12b3369275bb6 |
13 | 6269916a1286 |
14 | 2a53799034b8 |
15 | 143b1ed9e19c |
hex | a1878ab877a |
11100220000122 has 32 divisors (see below), whose sum is σ = 24276462981120. Its totient is φ = 3355675091120.
The previous prime is 11100220000099. The next prime is 11100220000157. The reversal of 11100220000122 is 22100002200111.
11100220000122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111002200001222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11100220000098 and 11100220000107.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 200670618 + ... + 200725925.
It is an arithmetic number, because the mean of its divisors is an integer number (758639468160).
Almost surely, 211100220000122 is an apocalyptic number.
11100220000122 is an abundant number, since it is smaller than the sum of its proper divisors (13176242980998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100220000122 is a wasteful number, since it uses less digits than its factorization.
11100220000122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401396978.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11100220000122 its reverse (22100002200111), we get a palindrome (33200222200233).
The spelling of 11100220000122 in words is "eleven trillion, one hundred billion, two hundred twenty million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •