Search a number
-
+
66537166080 = 2835711307733
BaseRepresentation
bin111101111101111011…
…001001010100000000
320100202002102020202110
4331331323021110000
52042232003303310
650322230215320
74543565402640
oct757573112400
9210662366673
1066537166080
112624454a760
1210a8b1b4540
136374bc19b8
143312b70520
151ae65e5d20
hexf7dec9500

66537166080 has 576 divisors, whose sum is σ = 266164512768. Its totient is φ = 13762068480.

The previous prime is 66537166079. The next prime is 66537166207. The reversal of 66537166080 is 8066173566.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 90773394 + ... + 90774126.

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

Almost surely, 266537166080 is an apocalyptic number.

66537166080 is a gapful number since it is divisible by the number (60) 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 66537166080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133082256384).

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

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

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

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

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

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

The spelling of 66537166080 in words is "sixty-six billion, five hundred thirty-seven million, one hundred sixty-six thousand, eighty".