Base | Representation |
---|---|
bin | 1100010110001… |
… | …1000011100000 |
3 | 10121102222222020 |
4 | 3011203003200 |
5 | 101224122302 |
6 | 5045541440 |
7 | 1166113311 |
oct | 305430340 |
9 | 117388866 |
10 | 51785952 |
11 | 27260609 |
12 | 15414880 |
13 | a96229a |
14 | 6c40608 |
15 | 482debc |
hex | 31630e0 |
51785952 has 96 divisors (see below), whose sum is σ = 142248960. Its totient is φ = 16481280.
The previous prime is 51785917. The next prime is 51785957. The reversal of 51785952 is 25958715.
It is a tau number, because it is divible by the number of its divisors (96).
Its product of digits (126000) is a multiple of the sum of its prime factors (336).
It is a zygodrome in base 7.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51785957) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232113 + ... + 232335.
It is an arithmetic number, because the mean of its divisors is an integer number (1481760).
Almost surely, 251785952 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 51785952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71124480).
51785952 is an abundant number, since it is smaller than the sum of its proper divisors (90463008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51785952 is a wasteful number, since it uses less digits than its factorization.
51785952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336 (or 328 counting only the distinct ones).
The product of its digits is 126000, while the sum is 42.
The square root of 51785952 is about 7196.2456878570. The cubic root of 51785952 is about 372.7382725505.
The spelling of 51785952 in words is "fifty-one million, seven hundred eighty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •