Base | Representation |
---|---|
bin | 110101001101011011… |
… | …101111011100101011 |
3 | 12110110202010022100011 |
4 | 311031123233130223 |
5 | 1414002211131330 |
6 | 42125153152351 |
7 | 4061553242461 |
oct | 651533573453 |
9 | 173422108304 |
10 | 57133692715 |
11 | 22259530a70 |
12 | b0a5b5b6b7 |
13 | 5506985188 |
14 | 2a9dd2c831 |
15 | 1745cbb82a |
hex | d4d6ef72b |
57133692715 has 32 divisors (see below), whose sum is σ = 78095612160. Its totient is φ = 39743894400.
The previous prime is 57133692703. The next prime is 57133692719. The reversal of 57133692715 is 51729633175.
It is not a de Polignac number, because 57133692715 - 211 = 57133690667 is a prime.
It is not an unprimeable number, because it can be changed into a prime (57133692719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3280 + ... + 338050.
It is an arithmetic number, because the mean of its divisors is an integer number (2440487880).
Almost surely, 257133692715 is an apocalyptic number.
57133692715 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
57133692715 is a deficient number, since it is larger than the sum of its proper divisors (20961919445).
57133692715 is a wasteful number, since it uses less digits than its factorization.
57133692715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334923.
The product of its digits is 1190700, while the sum is 49.
The spelling of 57133692715 in words is "fifty-seven billion, one hundred thirty-three million, six hundred ninety-two thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •