Base | Representation |
---|---|
bin | 1010000000111000001100… |
… | …0111101100001101001110 |
3 | 1102222120020211122201201110 |
4 | 2200032003013230031032 |
5 | 2420342342424323042 |
6 | 35230003322352450 |
7 | 2214314021303253 |
oct | 240160307541516 |
9 | 42876224581643 |
10 | 11010201011022 |
11 | 3565444487534 |
12 | 1299a2605b726 |
13 | 61b346960a55 |
14 | 2a0c7a2a142a |
15 | 14160202109c |
hex | a03831ec34e |
11010201011022 has 128 divisors (see below), whose sum is σ = 23775814656000. Its totient is φ = 3388509296640.
The previous prime is 11010201010937. The next prime is 11010201011059. The reversal of 11010201011022 is 22011010201011.
It is a junction number, because it is equal to n+sod(n) for n = 11010201010989 and 11010201011007.
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 63 ways as a sum of consecutive naturals, for example, 971854254 + ... + 971865582.
It is an arithmetic number, because the mean of its divisors is an integer number (185748552000).
Almost surely, 211010201011022 is an apocalyptic number.
11010201011022 is an abundant number, since it is smaller than the sum of its proper divisors (12765613644978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010201011022 is a wasteful number, since it uses less digits than its factorization.
11010201011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12646.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010201011022 its reverse (22011010201011), we get a palindrome (33021211212033).
The spelling of 11010201011022 in words is "eleven trillion, ten billion, two hundred one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •