Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0001101110010011101010 |
3 | 1102222122120120120012012022 |
4 | 2200032320301232103222 |
5 | 2420401213403101442 |
6 | 35230232521144442 |
7 | 2214345232051361 |
oct | 240167061562352 |
9 | 42878516505168 |
10 | 11011101222122 |
11 | 3565866643451 |
12 | 129a03762b122 |
13 | 61b45b2cc541 |
14 | 2a0d23a747d8 |
15 | 1416560903d2 |
hex | a03b8c6e4ea |
11011101222122 has 8 divisors (see below), whose sum is σ = 16919496999972. Its totient is φ = 5371268888800.
The previous prime is 11011101222089. The next prime is 11011101222133. The reversal of 11011101222122 is 22122210111011.
It can be written as a sum of positive squares in 2 ways, for example, as 7088368435201 + 3922732786921 = 2662399^2 + 1980589^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11011101222122.
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, 67140861029 + ... + 67140861192.
Almost surely, 211011101222122 is an apocalyptic number.
11011101222122 is a deficient number, since it is larger than the sum of its proper divisors (5908395777850).
11011101222122 is a wasteful number, since it uses less digits than its factorization.
11011101222122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134281722264.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11011101222122 its reverse (22122210111011), we get a palindrome (33133311333133).
Subtracting 11011101222122 from its reverse (22122210111011), we obtain a square (11111108888889 = 33333332).
It can be divided in two parts, 1101110 and 1222122, that added together give a palindrome (2323232).
The spelling of 11011101222122 in words is "eleven trillion, eleven billion, one hundred one million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •