Base | Representation |
---|---|
bin | 110101001100101100… |
… | …110011000011001101 |
3 | 12110102212222002122212 |
4 | 311030230303003031 |
5 | 1413441033333301 |
6 | 42124033320205 |
7 | 4061343530051 |
oct | 651454630315 |
9 | 173385862585 |
10 | 57121386701 |
11 | 22252596305 |
12 | b0a1a06065 |
13 | 5504266b02 |
14 | 2a9c447c61 |
15 | 1744b8a4bb |
hex | d4cb330cd |
57121386701 has 2 divisors, whose sum is σ = 57121386702. Its totient is φ = 57121386700.
The previous prime is 57121386653. The next prime is 57121386703. The reversal of 57121386701 is 10768312175.
It is a happy number.
57121386701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55554018601 + 1567368100 = 235699^2 + 39590^2 .
It is a cyclic number.
It is not a de Polignac number, because 57121386701 - 222 = 57117192397 is a prime.
Together with 57121386703, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57121386703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28560693350 + 28560693351.
It is an arithmetic number, because the mean of its divisors is an integer number (28560693351).
Almost surely, 257121386701 is an apocalyptic number.
It is an amenable number.
57121386701 is a deficient number, since it is larger than the sum of its proper divisors (1).
57121386701 is an equidigital number, since it uses as much as digits as its factorization.
57121386701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70560, while the sum is 41.
Adding to 57121386701 its reverse (10768312175), we get a palindrome (67889698876).
The spelling of 57121386701 in words is "fifty-seven billion, one hundred twenty-one million, three hundred eighty-six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •