Search a number
-
+
10002013015 = 534714713919
BaseRepresentation
bin10010101000010101…
…01001101101010111
3221211001112220110111
421110022221231113
5130441003404030
64332253503451
7502600464541
oct112412515527
927731486414
1010002013015
11427296a465
121b317a1b87
13c352437c7
146ac528691
153d815962a
hex2542a9b57

10002013015 has 16 divisors (see below), whose sum is σ = 12048261120. Its totient is φ = 7971092640.

The previous prime is 10002013001. The next prime is 10002013027. The reversal of 10002013015 is 51031020001.

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

It is not a de Polignac number, because 10002013015 - 219 = 10001488727 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10002012986 and 10002013004.

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 2550226 + ... + 2554144.

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

Almost surely, 210002013015 is an apocalyptic number.

10002013015 is a deficient number, since it is larger than the sum of its proper divisors (2046248105).

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

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

The sum of its prime factors is 5742.

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

Adding to 10002013015 its reverse (51031020001), we get a palindrome (61033033016).

The spelling of 10002013015 in words is "ten billion, two million, thirteen thousand, fifteen".

Divisors: 1 5 347 1471 1735 3919 7355 19595 510437 1359893 2552185 5764849 6799465 28824245 2000402603 10002013015