Base | Representation |
---|---|
bin | 1010000000010010101001… |
… | …0100010101101110110110 |
3 | 1102221121020100202021220212 |
4 | 2200010222110111232312 |
5 | 2420211222013020042 |
6 | 35221215205425422 |
7 | 2213506154425424 |
oct | 240045224255666 |
9 | 42847210667825 |
10 | 11000121220022 |
11 | 3561141724350 |
12 | 1297a9240b272 |
13 | 61a3cb58738c |
14 | 2a05a16cc114 |
15 | 141212151482 |
hex | a012a515bb6 |
11000121220022 has 32 divisors (see below), whose sum is σ = 18073443548160. Its totient is φ = 4979735578080.
The previous prime is 11000121220021. The next prime is 11000121220043. The reversal of 11000121220022 is 22002212100011.
It is a junction number, because it is equal to n+sod(n) for n = 11000121219979 and 11000121220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000121220021) by changing a digit.
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, 7696379 + ... + 9013017.
It is an arithmetic number, because the mean of its divisors is an integer number (564795110880).
Almost surely, 211000121220022 is an apocalyptic number.
11000121220022 is a deficient number, since it is larger than the sum of its proper divisors (7073322328138).
11000121220022 is a wasteful number, since it uses less digits than its factorization.
11000121220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1318196.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11000121220022 its reverse (22002212100011), we get a palindrome (33002333320033).
The spelling of 11000121220022 in words is "eleven trillion, one hundred twenty-one million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •