Base | Representation |
---|---|
bin | 1010000011100011001110… |
… | …00101000001100010001001 |
3 | 2220021220111200221100000122 |
4 | 11001301213011001202021 |
5 | 10344241312034310212 |
6 | 115010114124513025 |
7 | 4441361310253253 |
oct | 501614705014211 |
9 | 86256450840018 |
10 | 22112221010057 |
11 | 7055816328732 |
12 | 25915b60ab775 |
13 | c45234221729 |
14 | 566346c7acd3 |
15 | 2852c9e28272 |
hex | 141c67141889 |
22112221010057 has 2 divisors, whose sum is σ = 22112221010058. Its totient is φ = 22112221010056.
The previous prime is 22112221009981. The next prime is 22112221010071. The reversal of 22112221010057 is 75001012221122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20987934025081 + 1124286984976 = 4581259^2 + 1060324^2 .
It is a cyclic number.
It is not a de Polignac number, because 22112221010057 - 210 = 22112221009033 is a prime.
It is not a weakly prime, because it can be changed into another prime (22112221015057) 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, 11056110505028 + 11056110505029.
It is an arithmetic number, because the mean of its divisors is an integer number (11056110505029).
Almost surely, 222112221010057 is an apocalyptic number.
It is an amenable number.
22112221010057 is a deficient number, since it is larger than the sum of its proper divisors (1).
22112221010057 is an equidigital number, since it uses as much as digits as its factorization.
22112221010057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 22112221010057 its reverse (75001012221122), we get a palindrome (97113233231179).
The spelling of 22112221010057 in words is "twenty-two trillion, one hundred twelve billion, two hundred twenty-one million, ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •