Base | Representation |
---|---|
bin | 1010000001100000011111… |
… | …1111101100101001110110 |
3 | 1110000121011211220111022220 |
4 | 2200120013333230221312 |
5 | 2421032022134020042 |
6 | 35234553051503210 |
7 | 2215146104124531 |
oct | 240300777545166 |
9 | 43017154814286 |
10 | 11021020220022 |
11 | 3569a9666237a |
12 | 129bb45457b06 |
13 | 61c37c298477 |
14 | 2a15c514da18 |
15 | 141a36c9c8ec |
hex | a0607feca76 |
11021020220022 has 8 divisors (see below), whose sum is σ = 22042040440056. Its totient is φ = 3673673406672.
The previous prime is 11021020220017. The next prime is 11021020220047. The reversal of 11021020220022 is 22002202012011.
It is a sphenic number, since it is the product of 3 distinct primes.
11021020220022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11021020219983 and 11021020220010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918418351663 + ... + 918418351674.
It is an arithmetic number, because the mean of its divisors is an integer number (2755255055007).
Almost surely, 211021020220022 is an apocalyptic number.
11021020220022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021020220022 is a wasteful number, since it uses less digits than its factorization.
11021020220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1836836703342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 11021020220022 its reverse (22002202012011), we get a palindrome (33023222232033).
The spelling of 11021020220022 in words is "eleven trillion, twenty-one billion, twenty million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •