Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …10001100011101100100010 |
3 | 2121220002211022101021020221 |
4 | 10203113020301203230202 |
5 | 10111020442004013442 |
6 | 110330024324553254 |
7 | 4134362024304121 |
oct | 443271061435442 |
9 | 77802738337227 |
10 | 20022211001122 |
11 | 641a41014aa10 |
12 | 22b4531b5282a |
13 | b23117a72455 |
14 | 4d311a045ab8 |
15 | 24ac54c93467 |
hex | 1235c8c63b22 |
20022211001122 has 16 divisors (see below), whose sum is σ = 33252627228192. Its totient is φ = 8965169104320.
The previous prime is 20022211001119. The next prime is 20022211001123. The reversal of 20022211001122 is 22110011222002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 20022211001096 and 20022211001105.
It is not an unprimeable number, because it can be changed into a prime (20022211001123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6791793303 + ... + 6791796250.
It is an arithmetic number, because the mean of its divisors is an integer number (2078289201762).
Almost surely, 220022211001122 is an apocalyptic number.
20022211001122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20022211001122 is a deficient number, since it is larger than the sum of its proper divisors (13230416227070).
20022211001122 is a wasteful number, since it uses less digits than its factorization.
20022211001122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13583589633.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20022211001122 its reverse (22110011222002), we get a palindrome (42132222223124).
It can be divided in two parts, 2002 and 2211001122, that multiplied together give a palindrome (4426424246244).
The spelling of 20022211001122 in words is "twenty trillion, twenty-two billion, two hundred eleven million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •