Base | Representation |
---|---|
bin | 11010000001011000110001… |
… | …00110111000011100001001 |
3 | 21111121101122211112022212012 |
4 | 31000230120212320130021 |
5 | 30000012143101133231 |
6 | 321411313323425305 |
7 | 15024112666550612 |
oct | 1500543046703411 |
9 | 244541584468765 |
10 | 57222262130441 |
11 | 17261909211741 |
12 | 6502083985235 |
13 | 25c10615bb605 |
14 | 101b802418c09 |
15 | 693737e3ee2b |
hex | 340b189b8709 |
57222262130441 has 2 divisors, whose sum is σ = 57222262130442. Its totient is φ = 57222262130440.
The previous prime is 57222262130437. The next prime is 57222262130443. The reversal of 57222262130441 is 14403126222275.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57044259145225 + 178002985216 = 7552765^2 + 421904^2 .
It is a cyclic number.
It is not a de Polignac number, because 57222262130441 - 22 = 57222262130437 is a prime.
Together with 57222262130443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (57222262130443) 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, 28611131065220 + 28611131065221.
It is an arithmetic number, because the mean of its divisors is an integer number (28611131065221).
Almost surely, 257222262130441 is an apocalyptic number.
It is an amenable number.
57222262130441 is a deficient number, since it is larger than the sum of its proper divisors (1).
57222262130441 is an equidigital number, since it uses as much as digits as its factorization.
57222262130441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 322560, while the sum is 41.
The spelling of 57222262130441 in words is "fifty-seven trillion, two hundred twenty-two billion, two hundred sixty-two million, one hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •