Base | Representation |
---|---|
bin | 110101000101110111… |
… | …101111011110010001 |
3 | 12110010220101021000000 |
4 | 311011313233132101 |
5 | 1413222221040441 |
6 | 42104421520213 |
7 | 4055452635114 |
oct | 650567573621 |
9 | 173126337000 |
10 | 57006815121 |
11 | 221a3951a53 |
12 | b06b573069 |
13 | 54b65c0989 |
14 | 2a8b14257b |
15 | 1739aa82b6 |
hex | d45def791 |
57006815121 has 63 divisors (see below), whose sum is σ = 88212671211. Its totient is φ = 36822676464.
The previous prime is 57006815093. The next prime is 57006815143. The reversal of 57006815121 is 12151860075.
The square root of 57006815121 is 238761.
It is a perfect power (a square), and thus also a powerful number.
57006815121 is a `hidden beast` number, since 570 + 0 + 6 + 81 + 5 + 1 + 2 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 51010481025 + 5996334096 = 225855^2 + 77436^2 .
It is not a de Polignac number, because 57006815121 - 219 = 57006290833 is a prime.
It is not an unprimeable number, because it can be changed into a prime (57006815171) by changing a digit.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 238522120 + ... + 238522358.
Almost surely, 257006815121 is an apocalyptic number.
57006815121 is the 238761-st square number.
57006815121 is the 119381-st centered octagonal number.
It is an amenable number.
57006815121 is a deficient number, since it is larger than the sum of its proper divisors (31205856090).
57006815121 is an frugal number, since it uses more digits than its factorization.
57006815121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 570 (or 279 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
Multiplying 57006815121 by its sum of digits (36), we get a square (2052245344356 = 14325662).
The spelling of 57006815121 in words is "fifty-seven billion, six million, eight hundred fifteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •