Search a number
-
+
66500556150 = 23527474872767
BaseRepresentation
bin111101111011101111…
…011111010101110110
320100122112112021101010
4331323233133111312
52042143120244100
650314441413050
74542642254310
oct757357372566
9210575467333
1066500556150
1126225915116
1210a7aa9a186
13636a444212
14330bd607b0
151ae32b3750
hexf7bbdf576

66500556150 has 192 divisors, whose sum is σ = 192956792832. Its totient is φ = 14840807040.

The previous prime is 66500556127. The next prime is 66500556163. The reversal of 66500556150 is 5165500566.

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 266500556150 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 39.

The spelling of 66500556150 in words is "sixty-six billion, five hundred million, five hundred fifty-six thousand, one hundred fifty".