Base | Representation |
---|---|
bin | 1010000000111100010101… |
… | …0010010110010001011110 |
3 | 1102222200010012111010220220 |
4 | 2200033011102112101132 |
5 | 2420402131120213042 |
6 | 35230305415422210 |
7 | 2214353361022251 |
oct | 240170522262136 |
9 | 42880105433826 |
10 | 11011311101022 |
11 | 3565964063591 |
12 | 129a095984966 |
13 | 61b49293523b |
14 | 2a0d438a9098 |
15 | 1416696eb8ec |
hex | a03c549645e |
11011311101022 has 32 divisors (see below), whose sum is σ = 22050776720160. Its totient is φ = 3665745000960.
The previous prime is 11011311101009. The next prime is 11011311101033. The reversal of 11011311101022 is 22010111311011.
It is a junction number, because it is equal to n+sod(n) for n = 11011311100992 and 11011311101010.
It is a congruent number.
It is an unprimeable number.
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, 205205148 + ... + 205258800.
It is an arithmetic number, because the mean of its divisors is an integer number (689086772505).
Almost surely, 211011311101022 is an apocalyptic number.
11011311101022 is an abundant number, since it is smaller than the sum of its proper divisors (11039465619138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011311101022 is a wasteful number, since it uses less digits than its factorization.
11011311101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96748.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 11011311101022 its reverse (22010111311011), we get a palindrome (33021422412033).
The spelling of 11011311101022 in words is "eleven trillion, eleven billion, three hundred eleven million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •