Base | Representation |
---|---|
bin | 10100111001101010… |
… | …01001010011010110 |
3 | 1001222000111112220120 |
4 | 22130311021103112 |
5 | 140440101041042 |
6 | 5053243212410 |
7 | 545032610211 |
oct | 123465112326 |
9 | 31860445816 |
10 | 11221112022 |
11 | 48390305aa |
12 | 2211b17106 |
13 | 109a994273 |
14 | 7863ca778 |
15 | 45a1b8dec |
hex | 29cd494d6 |
11221112022 has 8 divisors (see below), whose sum is σ = 22442224056. Its totient is φ = 3740370672.
The previous prime is 11221112009. The next prime is 11221112041. The reversal of 11221112022 is 22021112211.
11221112022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11221112022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11221111992 and 11221112010.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 935092663 + ... + 935092674.
It is an arithmetic number, because the mean of its divisors is an integer number (2805278007).
Almost surely, 211221112022 is an apocalyptic number.
11221112022 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.
11221112022 is a wasteful number, since it uses less digits than its factorization.
11221112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870185342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11221112022 its reverse (22021112211), we get a palindrome (33242224233).
The spelling of 11221112022 in words is "eleven billion, two hundred twenty-one million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •