Search a number
-
+
10101600000 = 2832552361
BaseRepresentation
bin10010110100001101…
…00010111100000000
3222001222221110010100
421122012202330000
5131142002200000
64350212202400
7505220116602
oct113206427400
928058843110
1010101600000
1143140a9658
121b5b009400
13c4ca7130b
146bb84d172
153e1c7ba00
hex25a1a2f00

10101600000 has 648 divisors, whose sum is σ = 38609966304. Its totient is φ = 2534400000.

The previous prime is 10101599969. The next prime is 10101600043. The reversal of 10101600000 is 610101.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 165599970 + ... + 165600030.

Almost surely, 210101600000 is an apocalyptic number.

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

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

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

10101600000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 6, while the sum is 9.

The spelling of 10101600000 in words is "ten billion, one hundred one million, six hundred thousand".