Base | Representation |
---|---|
bin | 10100101100011011… |
… | …000010010010111101 |
3 | 2010100120002010002201 |
4 | 110230123002102331 |
5 | 331001322340102 |
6 | 14112514151501 |
7 | 1414430625454 |
oct | 245433022275 |
9 | 63316063081 |
10 | 22220121277 |
11 | 9472751aa2 |
12 | 4381582591 |
13 | 2131632973 |
14 | 110b0bdb9b |
15 | 8a0b0e987 |
hex | 52c6c24bd |
22220121277 has 2 divisors, whose sum is σ = 22220121278. Its totient is φ = 22220121276.
The previous prime is 22220121227. The next prime is 22220121289. The reversal of 22220121277 is 77212102222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19197210916 + 3022910361 = 138554^2 + 54981^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22220121277 is a prime.
It is a super-2 number, since 2×222201212772 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22220121227) 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 as a sum of consecutive naturals, namely, 11110060638 + 11110060639.
It is an arithmetic number, because the mean of its divisors is an integer number (11110060639).
Almost surely, 222220121277 is an apocalyptic number.
It is an amenable number.
22220121277 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220121277 is an equidigital number, since it uses as much as digits as its factorization.
22220121277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3136, while the sum is 28.
Adding to 22220121277 its reverse (77212102222), we get a palindrome (99432223499).
The spelling of 22220121277 in words is "twenty-two billion, two hundred twenty million, one hundred twenty-one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •