Search a number
-
+
161759015808 = 27313173161487
BaseRepresentation
bin1001011010100110010…
…1101011001110000000
3120110112021010102001120
42112221211223032000
510122240302001213
6202151105032240
714454352643115
oct2265145531600
9513467112046
10161759015808
1162668824835
1227424925680
131233b80a190
147b8739c90c
15431b0ec423
hex25a996b380

161759015808 has 256 divisors, whose sum is σ = 505756016640. Its totient is φ = 45332398080.

The previous prime is 161759015773. The next prime is 161759015827. The reversal of 161759015808 is 808510957161.

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

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, 2600041 + ... + 2661527.

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

Almost surely, 2161759015808 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

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

The spelling of 161759015808 in words is "one hundred sixty-one billion, seven hundred fifty-nine million, fifteen thousand, eight hundred eight".