Search a number
-
+
10501253500 = 225321002507
BaseRepresentation
bin10011100011110110…
…00110100101111100
31000002211221221122211
421301323012211330
5133001310103000
64454010150204
7521142116263
oct116173064574
930084857584
1010501253500
1144a9758201
122050a22364
13cb47c0c8a
147189635da
15416dc27ba
hex271ec697c

10501253500 has 24 divisors (see below), whose sum is σ = 22934738736. Its totient is φ = 4200501200.

The previous prime is 10501253467. The next prime is 10501253537. The reversal of 10501253500 is 535210501.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10500754 + ... + 10501753.

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

Almost surely, 210501253500 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The spelling of 10501253500 in words is "ten billion, five hundred one million, two hundred fifty-three thousand, five hundred".

Divisors: 1 2 4 5 10 20 25 50 100 125 250 500 21002507 42005014 84010028 105012535 210025070 420050140 525062675 1050125350 2100250700 2625313375 5250626750 10501253500