Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …1000000001101011001110 |
3 | 1102222122022200020220111112 |
4 | 2200032302320001223032 |
5 | 2420401013031223042 |
6 | 35230215023052022 |
7 | 2214342620345312 |
oct | 240166270015316 |
9 | 42878280226445 |
10 | 11011002211022 |
11 | 35658157679a0 |
12 | 129a00a441012 |
13 | 61b443943ba8 |
14 | 2a0d1485db42 |
15 | 14164c533982 |
hex | a03b2e01ace |
11011002211022 has 32 divisors (see below), whose sum is σ = 18112387809024. Its totient is φ = 4978806739200.
The previous prime is 11011002211007. The next prime is 11011002211037. The reversal of 11011002211022 is 22011220011011.
It is an interprime number because it is at equal distance from previous prime (11011002211007) and next prime (11011002211037).
It is a super-2 number, since 2×110110022110222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011002210988 and 11011002211006.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 8774903 + ... + 9950925.
It is an arithmetic number, because the mean of its divisors is an integer number (566012119032).
Almost surely, 211011002211022 is an apocalyptic number.
11011002211022 is a deficient number, since it is larger than the sum of its proper divisors (7101385598002).
11011002211022 is a wasteful number, since it uses less digits than its factorization.
11011002211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1178264.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11011002211022 its reverse (22011220011011), we get a palindrome (33022222222033).
The spelling of 11011002211022 in words is "eleven trillion, eleven billion, two million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •