Base | Representation |
---|---|
bin | 1101101100011… |
… | …1010110100010 |
3 | 11000002020101110 |
4 | 3123013112202 |
5 | 104201032100 |
6 | 5411044150 |
7 | 1265141352 |
oct | 333072642 |
9 | 130066343 |
10 | 57439650 |
11 | 2a472294 |
12 | 172a0656 |
13 | bb91778 |
14 | 78b2b62 |
15 | 5099250 |
hex | 36c75a2 |
57439650 has 48 divisors (see below), whose sum is σ = 143365824. Its totient is φ = 15218880.
The previous prime is 57439637. The next prime is 57439663. The reversal of 57439650 is 5693475.
It is an interprime number because it is at equal distance from previous prime (57439637) and next prime (57439663).
It is a junction number, because it is equal to n+sod(n) for n = 57439599 and 57439608.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23904 + ... + 26196.
It is an arithmetic number, because the mean of its divisors is an integer number (2986788).
Almost surely, 257439650 is an apocalyptic number.
57439650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 57439650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71682912).
57439650 is an abundant number, since it is smaller than the sum of its proper divisors (85926174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57439650 is a wasteful number, since it uses less digits than its factorization.
57439650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2475 (or 2470 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 39.
The square root of 57439650 is about 7578.8950381965. The cubic root of 57439650 is about 385.8370498901.
The spelling of 57439650 in words is "fifty-seven million, four hundred thirty-nine thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •