Search a number
-
+
10515012013 = 11958799709
BaseRepresentation
bin10011100101011111…
…00101100110101101
31000010210211221210101
421302233211212231
5133013320341023
64455221111101
7521400061462
oct116257454655
930123757711
1010515012013
1145064a5180
122055558491
13cb75ca4cc
1471a705669
154181de1ad
hex272be59ad

10515012013 has 8 divisors (see below), whose sum is σ = 11472233760. Its totient is φ = 9558008880.

The previous prime is 10515011971. The next prime is 10515012019. The reversal of 10515012013 is 31021051501.

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

It is a cyclic number.

It is not a de Polignac number, because 10515012013 - 29 = 10515011501 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 210515012013 is an apocalyptic number.

It is an amenable number.

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

10515012013 is an equidigital number, since it uses as much as digits as its factorization.

10515012013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 109307.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 10515012013 its reverse (31021051501), we get a palindrome (41536063514).

The spelling of 10515012013 in words is "ten billion, five hundred fifteen million, twelve thousand, thirteen".

Divisors: 1 11 9587 99709 105457 1096799 955910183 10515012013