Search a number
-
+
166473973050 = 2352711172573299
BaseRepresentation
bin1001101100001010011…
…1110011110100111010
3120220200212011001110120
42123002213303310322
510211414314114200
6204251014554110
715012244265130
oct2330247636472
9526625131416
10166473973050
1164668243a10
122831b968936
13129105a6cc8
1480b3661750
1544e4eeb9a0
hex26c29f3d3a

166473973050 has 384 divisors, whose sum is σ = 547293542400. Its totient is φ = 32420659200.

The previous prime is 166473972971. The next prime is 166473973109. The reversal of 166473973050 is 50379374661.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 50460301 + ... + 50463599.

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

Almost surely, 2166473973050 is an apocalyptic number.

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

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

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

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

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

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

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

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

The spelling of 166473973050 in words is "one hundred sixty-six billion, four hundred seventy-three million, nine hundred seventy-three thousand, fifty".