Base | Representation |
---|---|
bin | 1010000000010100000110… |
… | …00110111001000100111001 |
3 | 2212220021111001121000202221 |
4 | 11000022003012321010321 |
5 | 10340431043130041212 |
6 | 114443044030324041 |
7 | 4430343560234332 |
oct | 500120306710471 |
9 | 85807431530687 |
10 | 22001022112057 |
11 | 701264346482a |
12 | 2573b41959621 |
13 | c378c2527b31 |
14 | 560bd8773289 |
15 | 28246c961807 |
hex | 1402831b9139 |
22001022112057 has 2 divisors, whose sum is σ = 22001022112058. Its totient is φ = 22001022112056.
The previous prime is 22001022112021. The next prime is 22001022112079. The reversal of 22001022112057 is 75021122010022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21241996081216 + 759026030841 = 4608904^2 + 871221^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22001022112057 is a prime.
It is not a weakly prime, because it can be changed into another prime (22001002112057) 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, 11000511056028 + 11000511056029.
It is an arithmetic number, because the mean of its divisors is an integer number (11000511056029).
Almost surely, 222001022112057 is an apocalyptic number.
It is an amenable number.
22001022112057 is a deficient number, since it is larger than the sum of its proper divisors (1).
22001022112057 is an equidigital number, since it uses as much as digits as its factorization.
22001022112057 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 25.
Adding to 22001022112057 its reverse (75021122010022), we get a palindrome (97022144122079).
The spelling of 22001022112057 in words is "twenty-two trillion, one billion, twenty-two million, one hundred twelve thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •