Search a number
-
+
66104792832 = 28313311371559
BaseRepresentation
bin111101100100001001…
…110001011100000000
320022121221211102011110
4331210021301130000
52040340311332312
650211303043320
74530065316351
oct754411613400
9208557742143
1066104792832
11260424832a1
121098a440540
136306457140
1432b157dd28
151abd68a43c
hexf64271700

66104792832 has 288 divisors, whose sum is σ = 197134479360. Its totient is φ = 19527598080.

The previous prime is 66104792737. The next prime is 66104792839. The reversal of 66104792832 is 23829740166.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (66104792839) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42401269 + ... + 42402827.

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

Almost surely, 266104792832 is an apocalyptic number.

66104792832 is a gapful number since it is divisible by the number (62) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 66104792832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98567239680).

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

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

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

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

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

The product of its (nonzero) digits is 870912, while the sum is 48.

The spelling of 66104792832 in words is "sixty-six billion, one hundred four million, seven hundred ninety-two thousand, eight hundred thirty-two".