Search a number
-
+
10675507200 = 212352193159
BaseRepresentation
bin10011111000100111…
…10101000000000000
31000112222211221210120
421330103311000000
5133330412212300
64523153100240
7525356212461
oct117423650000
930488757716
1010675507200
114589055626
12209b257680
131011932487
14733b62d68
154273433a0
hex27c4f5000

10675507200 has 624 divisors, whose sum is σ = 39002265600. Its totient is φ = 2565734400.

The previous prime is 10675507147. The next prime is 10675507207. The reversal of 10675507200 is 270557601.

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

It is a congruent number.

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

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 47 ways as a sum of consecutive naturals, for example, 180940771 + ... + 180940829.

Almost surely, 210675507200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 14700, while the sum is 33.

The spelling of 10675507200 in words is "ten billion, six hundred seventy-five million, five hundred seven thousand, two hundred".