Base | Representation |
---|---|
bin | 1010000001011101100001… |
… | …0011001001010111110110 |
3 | 1110000112010002011201022120 |
4 | 2200113120103021113312 |
5 | 2421023402310341042 |
6 | 35234341424340410 |
7 | 2215120216353564 |
oct | 240273023112766 |
9 | 43015102151276 |
10 | 11020220012022 |
11 | 356971599a251 |
12 | 129b961474706 |
13 | 61c282571a00 |
14 | 2a154ab6ca34 |
15 | 1419db8d3dec |
hex | a05d84c95f6 |
11020220012022 has 48 divisors (see below), whose sum is σ = 23869272074688. Its totient is φ = 3390411155040.
The previous prime is 11020220011987. The next prime is 11020220012027. The reversal of 11020220012022 is 22021002202011.
It is a super-2 number, since 2×110202200120222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020220011992 and 11020220012010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020220012027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7444833 + ... + 8801475.
It is an arithmetic number, because the mean of its divisors is an integer number (497276501556).
Almost surely, 211020220012022 is an apocalyptic number.
11020220012022 is an abundant number, since it is smaller than the sum of its proper divisors (12849052062666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020220012022 is a wasteful number, since it uses less digits than its factorization.
11020220012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1364685 (or 1364672 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 11020220012022 its reverse (22021002202011), we get a palindrome (33041222214033).
The spelling of 11020220012022 in words is "eleven trillion, twenty billion, two hundred twenty million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •