Search a number
-
+
10006067200 = 211522329293
BaseRepresentation
bin10010101000110100…
…00111100000000000
3221211100011212202111
421110122013200000
5130443023122300
64332520425104
7502650111403
oct112432074000
927740155674
1010006067200
114275189428
121b33018194
13c36032c2c
146acca1d3a
153d86aa9ba
hex254687800

10006067200 has 288 divisors, whose sum is σ = 26871717600. Its totient is φ = 3683778560.

The previous prime is 10006067189. The next prime is 10006067207. The reversal of 10006067200 is 276060001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10006067207) by changing a digit.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34150254 + ... + 34150546.

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

Almost surely, 210006067200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 504, while the sum is 22.

The spelling of 10006067200 in words is "ten billion, six million, sixty-seven thousand, two hundred".