Search a number
-
+
10503660013 = 711281587827
BaseRepresentation
bin10011100100001000…
…10010000111101101
31000010000111012202221
421302010102013231
5133002414110023
64454133515341
7521201431330
oct116204220755
930100435687
1010503660013
114500051260
1220517a2b51
13cb5154452
14718dcc617
154171ea85d
hex2721121ed

10503660013 has 32 divisors (see below), whose sum is σ = 13180382208. Its totient is φ = 8131804800.

The previous prime is 10503659993. The next prime is 10503660049. The reversal of 10503660013 is 31006630501.

It is not a de Polignac number, because 10503660013 - 25 = 10503659981 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10503660013.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12700506 + ... + 12701332.

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

Almost surely, 210503660013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1713.

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

The spelling of 10503660013 in words is "ten billion, five hundred three million, six hundred sixty thousand, thirteen".

Divisors: 1 7 11 77 281 587 827 1967 3091 4109 5789 6457 9097 21637 45199 63679 164947 232387 485449 1154629 1626709 1814417 2556257 3398143 5339939 12700919 17893799 37379573 136411169 954878183 1500522859 10503660013