Search a number
-
+
65052019032 = 2337112131991237
BaseRepresentation
bin111100100101011001…
…110000100101011000
320012220120211222000020
4330211121300211120
52031211304102112
645515014310440
74462023016110
oct744531604530
9205816758006
1065052019032
1125652194800
1210735958420
136199300170
143211816040
151a5b03248c
hexf25670958

65052019032 has 384 divisors, whose sum is σ = 221294976000. Its totient is φ = 15505966080.

The previous prime is 65052019027. The next prime is 65052019061. The reversal of 65052019032 is 23091025056.

It is a Harshad number since it is a multiple of its sum of digits (33).

It is a junction number, because it is equal to n+sod(n) for n = 65052018984 and 65052019002.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 52587918 + ... + 52589154.

It is an arithmetic number, because the mean of its divisors is an integer number (576289000).

Almost surely, 265052019032 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 65052019032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110647488000).

65052019032 is an abundant number, since it is smaller than the sum of its proper divisors (156242956968).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

65052019032 is a wasteful number, since it uses less digits than its factorization.

65052019032 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1487 (or 1472 counting only the distinct ones).

The product of its (nonzero) digits is 16200, while the sum is 33.

The spelling of 65052019032 in words is "sixty-five billion, fifty-two million, nineteen thousand, thirty-two".