Base | Representation |
---|---|
bin | 10010101110001011… |
… | …000101100011110010 |
3 | 1220212221110222012110 |
4 | 102232023011203302 |
5 | 312132103323442 |
6 | 13122411510150 |
7 | 1311101163264 |
oct | 225613054362 |
9 | 56787428173 |
10 | 20102011122 |
11 | 8586074536 |
12 | 3a90158356 |
13 | 1b8487394b |
14 | d89a7bb34 |
15 | 7c9bbb69c |
hex | 4ae2c58f2 |
20102011122 has 16 divisors (see below), whose sum is σ = 40211770752. Its totient is φ = 6699378960.
The previous prime is 20102011103. The next prime is 20102011129. The reversal of 20102011122 is 22111020102.
It is a super-2 number, since 2×201020111222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20102011098 and 20102011107.
It is not an unprimeable number, because it can be changed into a prime (20102011129) by changing a digit.
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, 288853 + ... + 351624.
It is an arithmetic number, because the mean of its divisors is an integer number (2513235672).
Almost surely, 220102011122 is an apocalyptic number.
20102011122 is an abundant number, since it is smaller than the sum of its proper divisors (20109759630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20102011122 is a wasteful number, since it uses less digits than its factorization.
20102011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645713.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20102011122 its reverse (22111020102), we get a palindrome (42213031224).
It can be divided in two parts, 2010201 and 1122, that multiplied together give a palindrome (2255445522).
The spelling of 20102011122 in words is "twenty billion, one hundred two million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •