Base | Representation |
---|---|
bin | 110101010110111100… |
… | …010110101000100001 |
3 | 12110212212022222122012 |
4 | 311112330112220201 |
5 | 1414314032034034 |
6 | 42153052522305 |
7 | 4065531322466 |
oct | 652674265041 |
9 | 173785288565 |
10 | 57293236769 |
11 | 223305a185a |
12 | b12b480395 |
13 | 5530a46242 |
14 | 2ab71bd66d |
15 | 1754cd3cce |
hex | d56f16a21 |
57293236769 has 2 divisors, whose sum is σ = 57293236770. Its totient is φ = 57293236768.
The previous prime is 57293236723. The next prime is 57293236771. The reversal of 57293236769 is 96763239275.
It is a happy number.
57293236769 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., 39397486144 + 17895750625 = 198488^2 + 133775^2 .
It is a cyclic number.
It is not a de Polignac number, because 57293236769 - 212 = 57293232673 is a prime.
It is a super-2 number, since 2×572932367692 (a number of 22 digits) contains 22 as substring.
Together with 57293236771, 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 (57293286769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28646618384 + 28646618385.
It is an arithmetic number, because the mean of its divisors is an integer number (28646618385).
Almost surely, 257293236769 is an apocalyptic number.
It is an amenable number.
57293236769 is a deficient number, since it is larger than the sum of its proper divisors (1).
57293236769 is an equidigital number, since it uses as much as digits as its factorization.
57293236769 is an evil number, because the sum of its binary digits is even.
The product of its digits is 25719120, while the sum is 59.
The spelling of 57293236769 in words is "fifty-seven billion, two hundred ninety-three million, two hundred thirty-six thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •