Base | Representation |
---|---|
bin | 110101101110010111… |
… | …100100000101001100 |
3 | 12111220020211220112211 |
4 | 311232113210011030 |
5 | 1421120134330313 |
6 | 42300052240204 |
7 | 4111342666240 |
oct | 655627440514 |
9 | 174806756484 |
10 | 57686245708 |
11 | 22512422233 |
12 | b21b010064 |
13 | 55942aa700 |
14 | 2b13484420 |
15 | 1779565e3d |
hex | d6e5e414c |
57686245708 has 144 divisors (see below), whose sum is σ = 127486349760. Its totient is φ = 22359048192.
The previous prime is 57686245703. The next prime is 57686245709. The reversal of 57686245708 is 80754268675.
It is a happy number.
57686245708 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-5 number, since 5×576862457085 (a number of 55 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (57686245703) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 50030860 + ... + 50032012.
Almost surely, 257686245708 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 57686245708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63743174880).
57686245708 is an abundant number, since it is smaller than the sum of its proper divisors (69800104052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57686245708 is a wasteful number, since it uses less digits than its factorization.
57686245708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1396 (or 1381 counting only the distinct ones).
The product of its (nonzero) digits is 22579200, while the sum is 58.
The spelling of 57686245708 in words is "fifty-seven billion, six hundred eighty-six million, two hundred forty-five thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •