Search a number
-
+
10486502013 = 313268884667
BaseRepresentation
bin10011100010000101…
…10101001001111101
31000001211012111102110
421301002311021331
5132434021031023
64452322044233
7520602540111
oct116102651175
930054174373
1010486502013
1144a13a2199
122047aa9679
13cb17277a0
14716a03741
1541595ba93
hex2710b527d

10486502013 has 8 divisors (see below), whose sum is σ = 15057541408. Its totient is φ = 6453231984.

The previous prime is 10486501999. The next prime is 10486502023. The reversal of 10486502013 is 31020568401.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10486502013 - 210 = 10486500989 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10486502023) 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 7 ways as a sum of consecutive naturals, for example, 134442295 + ... + 134442372.

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

Almost surely, 210486502013 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 268884683.

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

The spelling of 10486502013 in words is "ten billion, four hundred eighty-six million, five hundred two thousand, thirteen".

Divisors: 1 3 13 39 268884667 806654001 3495500671 10486502013