Base | Representation |
---|---|
bin | 110101001100010100… |
… | …111011110101000000 |
3 | 12110102110012021201122 |
4 | 311030110323311000 |
5 | 1413432433144300 |
6 | 42123251251412 |
7 | 4061236414331 |
oct | 651424736500 |
9 | 173373167648 |
10 | 57115131200 |
11 | 2224a003476 |
12 | b09b8a9b68 |
13 | 5502b8672a |
14 | 2a9b69a288 |
15 | 1744351c85 |
hex | d4c53bd40 |
57115131200 has 84 divisors (see below), whose sum is σ = 148805985852. Its totient is φ = 21502156800.
The previous prime is 57115131193. The next prime is 57115131233. The reversal of 57115131200 is 213151175.
It can be written as a sum of positive squares in 6 ways, for example, as 1611540736 + 55503590464 = 40144^2 + 235592^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 57115131200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1022711 + ... + 1077110.
Almost surely, 257115131200 is an apocalyptic number.
57115131200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
57115131200 is an abundant number, since it is smaller than the sum of its proper divisors (91690854652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57115131200 is a wasteful number, since it uses less digits than its factorization.
57115131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2099860 (or 2099845 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 26.
Adding to 57115131200 its reverse (213151175), we get a palindrome (57328282375).
The spelling of 57115131200 in words is "fifty-seven billion, one hundred fifteen million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •