Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01010110111100110 |
3 | 1001102101011021011000 |
4 | 22100103222313212 |
5 | 140022304310042 |
6 | 5020340054130 |
7 | 536602020015 |
oct | 122023526746 |
9 | 31371137130 |
10 | 11011010022 |
11 | 4740478891 |
12 | 2173694346 |
13 | 10662b0b5c |
14 | 766538a7c |
15 | 446a1674c |
hex | 2904eade6 |
11011010022 has 16 divisors (see below), whose sum is σ = 24468911280. Its totient is φ = 3670336656.
The previous prime is 11011009987. The next prime is 11011010053. The reversal of 11011010022 is 22001011011.
It is a happy number.
11011010022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11011009986 and 11011010013.
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 7 ways as a sum of consecutive naturals, for example, 101953743 + ... + 101953850.
It is an arithmetic number, because the mean of its divisors is an integer number (1529306955).
Almost surely, 211011010022 is an apocalyptic number.
11011010022 is an abundant number, since it is smaller than the sum of its proper divisors (13457901258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011010022 is a wasteful number, since it uses less digits than its factorization.
11011010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203907604 (or 203907598 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11011010022 its reverse (22001011011), we get a palindrome (33012021033).
The spelling of 11011010022 in words is "eleven billion, eleven million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •