Base | Representation |
---|---|
bin | 110101001011111100… |
… | …110010001000000000 |
3 | 12110102000021121221202 |
4 | 311023330302020000 |
5 | 1413424323100000 |
6 | 42122503440332 |
7 | 4061131535120 |
oct | 651374621000 |
9 | 173360247852 |
10 | 57108800000 |
11 | 2224647977a |
12 | b0997560a8 |
13 | 550177aa65 |
14 | 2a9a8ccc80 |
15 | 1743a00dd5 |
hex | d4bf32200 |
57108800000 has 240 divisors, whose sum is σ = 163030190400. Its totient is φ = 19576320000.
The previous prime is 57108799991. The next prime is 57108800003. The reversal of 57108800000 is 880175.
It is a happy number.
It is a super-2 number, since 2×571088000002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (57108800003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11197451 + ... + 11202549.
It is an arithmetic number, because the mean of its divisors is an integer number (679292460).
Almost surely, 257108800000 is an apocalyptic number.
57108800000 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 57108800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81515095200).
57108800000 is an abundant number, since it is smaller than the sum of its proper divisors (105921390400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57108800000 is an frugal number, since it uses more digits than its factorization.
57108800000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5149 (or 5113 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 29.
The spelling of 57108800000 in words is "fifty-seven billion, one hundred eight million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •