Search a number
-
+
101064170368 = 2772931373391
BaseRepresentation
bin101111000011111100…
…1001101101110000000
3100122212100001210120001
41132013321031232000
53123434411422433
6114232255525344
710205315163010
oct1360771155600
9318770053501
10101064170368
11399520a9047
1217706229854
1396b8126b55
144c6a513c40
15296789457d
hex1787e4db80

101064170368 has 256 divisors, whose sum is σ = 252429926400. Its totient is φ = 39365222400.

The previous prime is 101064170353. The next prime is 101064170393. The reversal of 101064170368 is 863071460101.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2101064170368 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 101064170368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126214963200).

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

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

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

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

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

The product of its (nonzero) digits is 24192, while the sum is 37.

The spelling of 101064170368 in words is "one hundred one billion, sixty-four million, one hundred seventy thousand, three hundred sixty-eight".