Base | Representation |
---|---|
bin | 1101110011011… |
… | …0010001100100 |
3 | 11000221022121210 |
4 | 3130312101210 |
5 | 104310101423 |
6 | 5424511420 |
7 | 1302043065 |
oct | 334662144 |
9 | 130838553 |
10 | 57893988 |
11 | 2a752679 |
12 | 1747b570 |
13 | bcc04c9 |
14 | 799056c |
15 | 5138b93 |
hex | 3736464 |
57893988 has 48 divisors (see below), whose sum is σ = 146800640. Its totient is φ = 17690400.
The previous prime is 57893987. The next prime is 57894029. The reversal of 57893988 is 88939875.
57893988 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 (57).
It is not an unprimeable number, because it can be changed into a prime (57893987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2973 + ... + 11163.
Almost surely, 257893988 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 57893988, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73400320).
57893988 is an abundant number, since it is smaller than the sum of its proper divisors (88906652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57893988 is a wasteful number, since it uses less digits than its factorization.
57893988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8248 (or 8246 counting only the distinct ones).
The product of its digits is 4354560, while the sum is 57.
The square root of 57893988 is about 7608.8098938007. The cubic root of 57893988 is about 386.8516815076.
The spelling of 57893988 in words is "fifty-seven million, eight hundred ninety-three thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •