Base | Representation |
---|---|
bin | 10100101101000110… |
… | …001100001101011101 |
3 | 2010101100100212100022 |
4 | 110231012030031131 |
5 | 331012221342302 |
6 | 14114000441525 |
7 | 1414626033416 |
oct | 245506141535 |
9 | 63340325308 |
10 | 22231434077 |
11 | 9479079516 |
12 | 43853192a5 |
13 | 2133a93c28 |
14 | 110c7c680d |
15 | 8a1ae68a2 |
hex | 52d18c35d |
22231434077 has 2 divisors, whose sum is σ = 22231434078. Its totient is φ = 22231434076.
The previous prime is 22231434073. The next prime is 22231434097. The reversal of 22231434077 is 77043413222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19683809401 + 2547624676 = 140299^2 + 50474^2 .
It is a cyclic number.
It is not a de Polignac number, because 22231434077 - 22 = 22231434073 is a prime.
It is a super-3 number, since 3×222314340773 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22231434073) 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, 11115717038 + 11115717039.
It is an arithmetic number, because the mean of its divisors is an integer number (11115717039).
Almost surely, 222231434077 is an apocalyptic number.
It is an amenable number.
22231434077 is a deficient number, since it is larger than the sum of its proper divisors (1).
22231434077 is an equidigital number, since it uses as much as digits as its factorization.
22231434077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 35.
Adding to 22231434077 its reverse (77043413222), we get a palindrome (99274847299).
The spelling of 22231434077 in words is "twenty-two billion, two hundred thirty-one million, four hundred thirty-four thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •