Base | Representation |
---|---|
bin | 11101000111000011110… |
… | …00100101110001100001 |
3 | 10112121202012101100021212 |
4 | 32203201320211301201 |
5 | 112341423330333212 |
6 | 2043255023155505 |
7 | 132156302515205 |
oct | 16434170456141 |
9 | 3477665340255 |
10 | 1000222121057 |
11 | 356212347815 |
12 | 141a24445b95 |
13 | 734222c9813 |
14 | 365a7b46b05 |
15 | 1b040edee22 |
hex | e8e1e25c61 |
1000222121057 has 2 divisors, whose sum is σ = 1000222121058. Its totient is φ = 1000222121056.
The previous prime is 1000222121039. The next prime is 1000222121081. The reversal of 1000222121057 is 7501212220001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 966100273216 + 34121847841 = 982904^2 + 184721^2 .
It is an emirp because it is prime and its reverse (7501212220001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1000222121057 - 218 = 1000221858913 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000222121027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500111060528 + 500111060529.
It is an arithmetic number, because the mean of its divisors is an integer number (500111060529).
Almost surely, 21000222121057 is an apocalyptic number.
It is an amenable number.
1000222121057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000222121057 is an equidigital number, since it uses as much as digits as its factorization.
1000222121057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 1000222121057 its reverse (7501212220001), we get a palindrome (8501434341058).
The spelling of 1000222121057 in words is "one trillion, two hundred twenty-two million, one hundred twenty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •