Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …1010101001111100111110 |
3 | 1110000121010120211222011120 |
4 | 2200120012322221330332 |
5 | 2421032003020333042 |
6 | 35234551203531410 |
7 | 2215145464234005 |
oct | 240300672517476 |
9 | 43017116758146 |
10 | 11021002121022 |
11 | 3569a87420323 |
12 | 129bb3b389b66 |
13 | 61c3785cc3ba |
14 | 2a15c299bc3c |
15 | 141a353c4dec |
hex | a0606ea9f3e |
11021002121022 has 16 divisors (see below), whose sum is σ = 22070667455760. Its totient is φ = 3668890171392.
The previous prime is 11021002120901. The next prime is 11021002121029. The reversal of 11021002121022 is 22012120012011.
11021002121022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11021002120992 and 11021002121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021002121029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1194295573 + ... + 1194304800.
It is an arithmetic number, because the mean of its divisors is an integer number (1379416715985).
Almost surely, 211021002121022 is an apocalyptic number.
11021002121022 is an abundant number, since it is smaller than the sum of its proper divisors (11049665334738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021002121022 is a wasteful number, since it uses less digits than its factorization.
11021002121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2388601147.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11021002121022 its reverse (22012120012011), we get a palindrome (33033122133033).
The spelling of 11021002121022 in words is "eleven trillion, twenty-one billion, two million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •