Base | Representation |
---|---|
bin | 1010000110011001100010… |
… | …10000001000111100001010 |
3 | 2220122021011012200002012101 |
4 | 11003030301100020330022 |
5 | 10402342242130431442 |
6 | 115123102522304014 |
7 | 4451425015542202 |
oct | 503146120107412 |
9 | 86567135602171 |
10 | 22210102202122 |
11 | 7093284749a9a |
12 | 25a857235800a |
13 | c51532a89663 |
14 | 56ad90757402 |
15 | 287b08132cb7 |
hex | 143331408f0a |
22210102202122 has 8 divisors (see below), whose sum is σ = 33315787539972. Its totient is φ = 11104839688800.
The previous prime is 22210102202111. The next prime is 22210102202129. The reversal of 22210102202122 is 22120220101222.
It can be written as a sum of positive squares in 2 ways, for example, as 15251063478121 + 6959038724001 = 3905261^2 + 2637999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 22210102202122.
It is not an unprimeable number, because it can be changed into a prime (22210102202129) 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 3 ways as a sum of consecutive naturals, for example, 105574779 + ... + 105784942.
Almost surely, 222210102202122 is an apocalyptic number.
22210102202122 is a deficient number, since it is larger than the sum of its proper divisors (11105685337850).
22210102202122 is a wasteful number, since it uses less digits than its factorization.
22210102202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211412264.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22210102202122 its reverse (22120220101222), we get a palindrome (44330322303344).
The spelling of 22210102202122 in words is "twenty-two trillion, two hundred ten billion, one hundred two million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •