Search a number
-
+
10015005100 = 2252100150051
BaseRepresentation
bin10010101001111000…
…01101100110101100
3221211221222222020211
421110330031212230
5131002320130400
64333440152204
7503116065412
oct112474154654
927757888224
1010015005100
11427a233621
121b36008664
13c37b42229
146b014b2b2
153d9373dba
hex254f0d9ac

10015005100 has 18 divisors (see below), whose sum is σ = 21732561284. Its totient is φ = 4006002000.

The previous prime is 10015005073. The next prime is 10015005101. The reversal of 10015005100 is 150051001.

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

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

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 5 ways as a sum of consecutive naturals, for example, 50074926 + ... + 50075125.

Almost surely, 210015005100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 13.

Adding to 10015005100 its reverse (150051001), we get a palindrome (10165056101).

The spelling of 10015005100 in words is "ten billion, fifteen million, five thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 100150051 200300102 400600204 500750255 1001500510 2003001020 2503751275 5007502550 10015005100