Base | Representation |
---|---|
bin | 1010000001100000111000… |
… | …0000001011110101001110 |
3 | 1110000121102212120012120220 |
4 | 2200120032000023311032 |
5 | 2421032223434323042 |
6 | 35235011052052210 |
7 | 2215151436623043 |
oct | 240301600136516 |
9 | 43017385505526 |
10 | 11021121011022 |
11 | 356a038544121 |
12 | 129bb73164066 |
13 | 61c397128005 |
14 | 2a15d46a91ca |
15 | 141a40a5b8ec |
hex | a060e00bd4e |
11021121011022 has 16 divisors (see below), whose sum is σ = 22141086159360. Its totient is φ = 3657232980792.
The previous prime is 11021121010973. The next prime is 11021121011029. The reversal of 11021121011022 is 22011012112011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11021121010992 and 11021121011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021121011029) 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, 4118504272 + ... + 4118506947.
It is an arithmetic number, because the mean of its divisors is an integer number (1383817884960).
Almost surely, 211021121011022 is an apocalyptic number.
11021121011022 is an abundant number, since it is smaller than the sum of its proper divisors (11119965148338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021121011022 is a wasteful number, since it uses less digits than its factorization.
11021121011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8237011447.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11021121011022 its reverse (22011012112011), we get a palindrome (33032133123033).
The spelling of 11021121011022 in words is "eleven trillion, twenty-one billion, one hundred twenty-one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •