Base | Representation |
---|---|
bin | 11010000001011000110001… |
… | …00100111000011011100001 |
3 | 21111121101122210112200121122 |
4 | 31000230120210320123201 |
5 | 30000012142432343423 |
6 | 321411313304302025 |
7 | 15024112662235142 |
oct | 1500543044703341 |
9 | 244541583480548 |
10 | 57222261606113 |
11 | 1726190899380a |
12 | 6502083771915 |
13 | 25c1061466a66 |
14 | 101b80231dac9 |
15 | 693737d898c8 |
hex | 340b189386e1 |
57222261606113 has 2 divisors, whose sum is σ = 57222261606114. Its totient is φ = 57222261606112.
The previous prime is 57222261606109. The next prime is 57222261606161. The reversal of 57222261606113 is 31160616222275.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37211061407569 + 20011200198544 = 6100087^2 + 4473388^2 .
It is a cyclic number.
It is not a de Polignac number, because 57222261606113 - 22 = 57222261606109 is a prime.
It is not a weakly prime, because it can be changed into another prime (57222261606163) 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, 28611130803056 + 28611130803057.
It is an arithmetic number, because the mean of its divisors is an integer number (28611130803057).
Almost surely, 257222261606113 is an apocalyptic number.
It is an amenable number.
57222261606113 is a deficient number, since it is larger than the sum of its proper divisors (1).
57222261606113 is an equidigital number, since it uses as much as digits as its factorization.
57222261606113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
Adding to 57222261606113 its reverse (31160616222275), we get a palindrome (88382877828388).
The spelling of 57222261606113 in words is "fifty-seven trillion, two hundred twenty-two billion, two hundred sixty-one million, six hundred six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •