Base | Representation |
---|---|
bin | 110101000111000100… |
… | …111000000111101100 |
3 | 12110012022102120022200 |
4 | 311013010320013230 |
5 | 1413242410120003 |
6 | 42110423141500 |
7 | 4056116543043 |
oct | 650704700754 |
9 | 173168376280 |
10 | 57027035628 |
11 | 22204302a12 |
12 | b0762a4890 |
13 | 54ba850584 |
14 | 2a8dac755a |
15 | 173b74e6a3 |
hex | d471381ec |
57027035628 has 72 divisors (see below), whose sum is σ = 148087242576. Its totient is φ = 18492672000.
The previous prime is 57027035627. The next prime is 57027035647. The reversal of 57027035628 is 82653072075.
57027035628 is a `hidden beast` number, since 5 + 7 + 0 + 270 + 356 + 28 = 666.
It is not an unprimeable number, because it can be changed into a prime (57027035627) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 466303 + ... + 575753.
It is an arithmetic number, because the mean of its divisors is an integer number (2056767258).
Almost surely, 257027035628 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57027035628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74043621288).
57027035628 is an abundant number, since it is smaller than the sum of its proper divisors (91060206948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57027035628 is a wasteful number, since it uses less digits than its factorization.
57027035628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109855 (or 109850 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 45.
The spelling of 57027035628 in words is "fifty-seven billion, twenty-seven million, thirty-five thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •