Search a number
-
+
164851563064 = 23191084549757
BaseRepresentation
bin1001100110000111101…
…0110011101000111000
3120202111210022002100211
42121201322303220320
510200104000004224
6203422021040504
714624114110636
oct2314172635070
9522453262324
10164851563064
1163a05456311
1227b48556134
1312712425bb6
147d9bdb6356
15444c872894
hex2661eb3a38

164851563064 has 16 divisors (see below), whose sum is σ = 325364927400. Its totient is φ = 78087582432.

The previous prime is 164851563061. The next prime is 164851563077. The reversal of 164851563064 is 460365158461.

164851563064 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

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

It is a congruent number.

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

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 3 ways as a sum of consecutive naturals, for example, 542274727 + ... + 542275030.

Almost surely, 2164851563064 is an apocalyptic number.

It is an amenable number.

164851563064 is a deficient number, since it is larger than the sum of its proper divisors (160513364336).

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

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

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

The product of its (nonzero) digits is 2073600, while the sum is 49.

The spelling of 164851563064 in words is "one hundred sixty-four billion, eight hundred fifty-one million, five hundred sixty-three thousand, sixty-four".

Divisors: 1 2 4 8 19 38 76 152 1084549757 2169099514 4338199028 8676398056 20606445383 41212890766 82425781532 164851563064