Base | Representation |
---|---|
bin | 1101101110000… |
… | …0000000011111 |
3 | 11000021100220210 |
4 | 3123200000133 |
5 | 104212300024 |
6 | 5413143503 |
7 | 1266041652 |
oct | 333400037 |
9 | 130240823 |
10 | 57540639 |
11 | 2a531152 |
12 | 1732ab93 |
13 | bbc8720 |
14 | 78db899 |
15 | 50b9129 |
hex | 36e001f |
57540639 has 8 divisors (see below), whose sum is σ = 82622512. Its totient is φ = 35409600.
The previous prime is 57540599. The next prime is 57540653. The reversal of 57540639 is 93604575.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 57540639 - 29 = 57540127 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1475401 = 57540639 / (5 + 7 + 5 + 4 + 0 + 6 + 3 + 9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57540597 and 57540606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57540689) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 737662 + ... + 737739.
It is an arithmetic number, because the mean of its divisors is an integer number (10327814).
Almost surely, 257540639 is an apocalyptic number.
57540639 is a deficient number, since it is larger than the sum of its proper divisors (25081873).
57540639 is a wasteful number, since it uses less digits than its factorization.
57540639 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1475417.
The product of its (nonzero) digits is 113400, while the sum is 39.
The square root of 57540639 is about 7585.5546270527. The cubic root of 57540639 is about 386.0630406134.
It can be divided in two parts, 575 and 40639, that added together give a palindrome (41214).
The spelling of 57540639 in words is "fifty-seven million, five hundred forty thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •