Base | Representation |
---|---|
bin | 110101001000110111… |
… | …011001100011101000 |
3 | 12110021101220210220100 |
4 | 311020313121203220 |
5 | 1413323101311000 |
6 | 42113414425400 |
7 | 4056632660646 |
oct | 651067314350 |
9 | 173241823810 |
10 | 57057057000 |
11 | 2221a248469 |
12 | b084362260 |
13 | 54c3b321b8 |
14 | 2a93aa0196 |
15 | 173e1cea00 |
hex | d48dd98e8 |
57057057000 has 192 divisors, whose sum is σ = 203003611200. Its totient is φ = 14414371200.
The previous prime is 57057056999. The next prime is 57057057011. The reversal of 57057057000 is 75075075.
57057057000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4167 + ... + 337833.
It is an arithmetic number, because the mean of its divisors is an integer number (1057310475).
Almost surely, 257057057000 is an apocalyptic number.
57057057000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57057057000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101501805600).
57057057000 is an abundant number, since it is smaller than the sum of its proper divisors (145946554200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57057057000 is a wasteful number, since it uses less digits than its factorization.
57057057000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333713 (or 333696 counting only the distinct ones).
The product of its (nonzero) digits is 42875, while the sum is 36.
The spelling of 57057057000 in words is "fifty-seven billion, fifty-seven million, fifty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •