Search a number
-
+
10105629600 = 25352112172389
BaseRepresentation
bin10010110100101011…
…11010101110100000
3222002021112011200210
421122111322232200
5131144020121400
64350434414120
7505266301653
oct113225725640
928067464623
1010105629600
114316401100
121b60431340
13c508524b1
146bc1bb89a
153e22c5950
hex25a57aba0

10105629600 has 864 divisors, whose sum is σ = 40396164480. Its totient is φ = 2180710400.

The previous prime is 10105629571. The next prime is 10105629629. The reversal of 10105629600 is 692650101.

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

It is an interprime number because it is at equal distance from previous prime (10105629571) and next prime (10105629629).

It is a super-2 number, since 2×101056296002 (a number of 21 digits) contains 22 as substring.

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

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 143 ways as a sum of consecutive naturals, for example, 113546356 + ... + 113546444.

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

Almost surely, 210105629600 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 30.

The spelling of 10105629600 in words is "ten billion, one hundred five million, six hundred twenty-nine thousand, six hundred".