Base | Representation |
---|---|
bin | 111011111011101… |
… | …1011101011110110 |
3 | 12012011002101212001 |
4 | 1313313123223312 |
5 | 13104310120042 |
6 | 531315045514 |
7 | 100556250064 |
oct | 16767335366 |
9 | 5164071761 |
10 | 2011020022 |
11 | 942194120 |
12 | 4815a089a |
13 | 26083529b |
14 | 151127034 |
15 | bb83cbb7 |
hex | 77ddbaf6 |
2011020022 has 32 divisors (see below), whose sum is σ = 3468523680. Its totient is φ = 865912320.
The previous prime is 2011020017. The next prime is 2011020023. The reversal of 2011020022 is 2200201102.
It is a junction number, because it is equal to n+sod(n) for n = 2011019990 and 2011020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011020023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4078 + ... + 63550.
It is an arithmetic number, because the mean of its divisors is an integer number (108391365).
Almost surely, 22011020022 is an apocalyptic number.
2011020022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2011020022 is a deficient number, since it is larger than the sum of its proper divisors (1457503658).
2011020022 is a wasteful number, since it uses less digits than its factorization.
2011020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59568.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 2011020022 is about 44844.3978886995. The cubic root of 2011020022 is about 1262.2308723076.
Adding to 2011020022 its reverse (2200201102), we get a palindrome (4211221124).
The spelling of 2011020022 in words is "two billion, eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •