Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1011000000001010001110 |
3 | 1102221200211001102002200120 |
4 | 2200011211323000022032 |
5 | 2420220244012223042 |
6 | 35221502331005410 |
7 | 2213543016261165 |
oct | 240054573001216 |
9 | 42850731362616 |
10 | 11001121211022 |
11 | 3561605141398 |
12 | 1298111299866 |
13 | 61a52a7c0427 |
14 | 2a06584363dc |
15 | 14126ed2edec |
hex | a0165ec028e |
11001121211022 has 16 divisors (see below), whose sum is σ = 22002312121680. Its totient is φ = 3667028787072.
The previous prime is 11001121210993. The next prime is 11001121211027. The reversal of 11001121211022 is 22011212110011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11001121210992 and 11001121211010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001121211027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 726697 + ... + 4746612.
It is an arithmetic number, because the mean of its divisors is an integer number (1375144507605).
Almost surely, 211001121211022 is an apocalyptic number.
11001121211022 is an abundant number, since it is smaller than the sum of its proper divisors (11001190910658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001121211022 is a wasteful number, since it uses less digits than its factorization.
11001121211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5808307.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11001121211022 its reverse (22011212110011), we get a palindrome (33012333321033).
The spelling of 11001121211022 in words is "eleven trillion, one billion, one hundred twenty-one million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •