Base | Representation |
---|---|
bin | 1001001001010011110110… |
… | …00101111001000111101010 |
3 | 2122012121021021112000011222 |
4 | 10210221323011321013222 |
5 | 10114000014104201442 |
6 | 110434525052022042 |
7 | 4143656566436546 |
oct | 444517305710752 |
9 | 78177237460158 |
10 | 20111102022122 |
11 | 6454085883731 |
12 | 23097bb461922 |
13 | b2b612bbbb27 |
14 | 4d754d948a26 |
15 | 24d208ab38d2 |
hex | 124a7b1791ea |
20111102022122 has 4 divisors (see below), whose sum is σ = 30166653033186. Its totient is φ = 10055551011060.
The previous prime is 20111102022113. The next prime is 20111102022131. The reversal of 20111102022122 is 22122020111102.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20111102022113) and next prime (20111102022131).
It can be written as a sum of positive squares in only one way, i.e., 17790351415321 + 2320750606801 = 4217861^2 + 1523401^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 20111102022122.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 5027775505529 + ... + 5027775505532.
Almost surely, 220111102022122 is an apocalyptic number.
20111102022122 is a deficient number, since it is larger than the sum of its proper divisors (10055551011064).
20111102022122 is a wasteful number, since it uses less digits than its factorization.
20111102022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10055551011063.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20111102022122 its reverse (22122020111102), we get a palindrome (42233122133224).
The spelling of 20111102022122 in words is "twenty trillion, one hundred eleven billion, one hundred two million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •