Search a number
-
+
166993653120 = 2735719165053
BaseRepresentation
bin1001101110000110011…
…0001110110110000000
3120222001002000112111120
42123201212032312000
510214000333344440
6204414341312240
715031154426310
oct2334146166600
9528032015446
10166993653120
1164904622278
1228445a05680
131299415c9c8
14812269b440
154525950dd0
hex26e198ed80

166993653120 has 256 divisors, whose sum is σ = 611528417280. Its totient is φ = 37969551360.

The previous prime is 166993653119. The next prime is 166993653133. The reversal of 166993653120 is 21356399661.

It is a happy number.

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 31 ways as a sum of consecutive naturals, for example, 2534514 + ... + 2599566.

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

Almost surely, 2166993653120 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 51.

The spelling of 166993653120 in words is "one hundred sixty-six billion, nine hundred ninety-three million, six hundred fifty-three thousand, one hundred twenty".