Base | Representation |
---|---|
bin | 1010000000010100000110… |
… | …00010101110111110101010 |
3 | 2212220021110222112122122222 |
4 | 11000022003002232332222 |
5 | 10340431042340201442 |
6 | 114443043551114042 |
7 | 4430343545044562 |
oct | 500120302567652 |
9 | 85807428478588 |
10 | 22001021022122 |
11 | 701264288a95a |
12 | 2573b41512922 |
13 | c378c22359bc |
14 | 560bd856bda2 |
15 | 28246c7e88d2 |
hex | 1402830aefaa |
22001021022122 has 4 divisors (see below), whose sum is σ = 33001531533186. Its totient is φ = 11000510511060.
The previous prime is 22001021022109. The next prime is 22001021022157. The reversal of 22001021022122 is 22122012010022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 16638559163521 + 5362461858601 = 4079039^2 + 2315699^2 .
It is a super-2 number, since 2×220010210221222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22001021022122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500255255529 + ... + 5500255255532.
Almost surely, 222001021022122 is an apocalyptic number.
22001021022122 is a deficient number, since it is larger than the sum of its proper divisors (11000510511064).
22001021022122 is a wasteful number, since it uses less digits than its factorization.
22001021022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11000510511063.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 22001021022122 its reverse (22122012010022), we get a palindrome (44123033032144).
The spelling of 22001021022122 in words is "twenty-two trillion, one billion, twenty-one million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •