Base | Representation |
---|---|
bin | 110010000011001100101100… |
… | …111001101010000000001101 |
3 | 1001212101110200011120001112112 |
4 | 302003030230321222000031 |
5 | 212322440101240332203 |
6 | 2100054412410113405 |
7 | 64236204251034164 |
oct | 6203145471520015 |
9 | 1055343604501475 |
10 | 220122122199053 |
11 | 641572a4456018 |
12 | 2083118541b865 |
13 | 95a957231b159 |
14 | 3c4dd78db23db |
15 | 1a6ad3537a6d8 |
hex | c8332ce6a00d |
220122122199053 has 2 divisors, whose sum is σ = 220122122199054. Its totient is φ = 220122122199052.
The previous prime is 220122122198999. The next prime is 220122122199061. The reversal of 220122122199053 is 350991221221022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131514955192009 + 88607167007044 = 11467997^2 + 9413138^2 .
It is a cyclic number.
It is not a de Polignac number, because 220122122199053 - 26 = 220122122198989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220122122199053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220122122139053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110061061099526 + 110061061099527.
It is an arithmetic number, because the mean of its divisors is an integer number (110061061099527).
Almost surely, 2220122122199053 is an apocalyptic number.
It is an amenable number.
220122122199053 is a deficient number, since it is larger than the sum of its proper divisors (1).
220122122199053 is an equidigital number, since it uses as much as digits as its factorization.
220122122199053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 41.
The spelling of 220122122199053 in words is "two hundred twenty trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred ninety-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •