Search a number
-
+
10005656670 = 23254373107331
BaseRepresentation
bin10010101000110001…
…00011010001011110
3221211022102000121200
421110120203101132
5130442422003140
64332503540330
7502643451462
oct112430432136
927738360550
1010005656670
114274a28a49
121b32a5a6a6
13c35c1b109
146acbd64a2
153d8629030
hex25462345e

10005656670 has 192 divisors, whose sum is σ = 27318829824. Its totient is φ = 2538708480.

The previous prime is 10005656641. The next prime is 10005656693. The reversal of 10005656670 is 7665650001.

It is a happy number.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 30228405 + ... + 30228735.

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

Almost surely, 210005656670 is an apocalyptic number.

10005656670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

The product of its (nonzero) digits is 37800, while the sum is 36.

The spelling of 10005656670 in words is "ten billion, five million, six hundred fifty-six thousand, six hundred seventy".