Base | Representation |
---|---|
bin | 110101110010000111… |
… | …111100101001011000 |
3 | 12112001122102102010101 |
4 | 311302013330221120 |
5 | 1421232302322023 |
6 | 42310223025144 |
7 | 4113036422044 |
oct | 656207745130 |
9 | 175048372111 |
10 | 57749260888 |
11 | 22544a524a0 |
12 | b23813b1b4 |
13 | 55a4371bb7 |
14 | 2b1b9a9024 |
15 | 177ed621ad |
hex | d721fca58 |
57749260888 has 96 divisors (see below), whose sum is σ = 122461094160. Its totient is φ = 25310754560.
The previous prime is 57749260853. The next prime is 57749260927. The reversal of 57749260888 is 88806294775.
It is a super-2 number, since 2×577492608882 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (64) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16233606 + ... + 16237162.
Almost surely, 257749260888 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 57749260888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61230547080).
57749260888 is an abundant number, since it is smaller than the sum of its proper divisors (64711833272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57749260888 is a wasteful number, since it uses less digits than its factorization.
57749260888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3745 (or 3682 counting only the distinct ones).
The product of its (nonzero) digits is 54190080, while the sum is 64.
The spelling of 57749260888 in words is "fifty-seven billion, seven hundred forty-nine million, two hundred sixty thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.004 sec. • engine limits •