Base | Representation |
---|---|
bin | 110101010101101010… |
… | …000101000111101001 |
3 | 12110211100202020112021 |
4 | 311111222011013221 |
5 | 1414243021403400 |
6 | 42151002344441 |
7 | 4065150104401 |
oct | 652552050751 |
9 | 173740666467 |
10 | 57271669225 |
11 | 2231a400841 |
12 | b1241bb121 |
13 | 5529434494 |
14 | 2ab43a7801 |
15 | 1752e7371a |
hex | d55a851e9 |
57271669225 has 27 divisors (see below), whose sum is σ = 74274498949. Its totient is φ = 43804217600.
The previous prime is 57271669181. The next prime is 57271669229. The reversal of 57271669225 is 52296617275.
The square root of 57271669225 is 239315.
It is a perfect power (a square), and thus also a powerful number.
57271669225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3905125081 + 53366544144 = 62491^2 + 231012^2 .
It is not a de Polignac number, because 57271669225 - 211 = 57271667177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57271669229) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 27520185 + ... + 27522265.
Almost surely, 257271669225 is an apocalyptic number.
57271669225 is the 239315-th square number.
57271669225 is the 119658-th centered octagonal number.
It is an amenable number.
57271669225 is a deficient number, since it is larger than the sum of its proper divisors (17002829724).
57271669225 is an frugal number, since it uses more digits than its factorization.
57271669225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4218 (or 2109 counting only the distinct ones).
The product of its digits is 3175200, while the sum is 52.
The spelling of 57271669225 in words is "fifty-seven billion, two hundred seventy-one million, six hundred sixty-nine thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •