Search a number
-
+
10864851513 = 327113363901
BaseRepresentation
bin10100001111001100…
…00111101000111001
31001001012010122100220
422013212013220321
5134222400222023
64554035250253
7533145466635
oct120746075071
931035118326
1010864851513
114675a1a82a
122132749989
131041c28629
14750d6ddc5
15438c953e3
hex287987a39

10864851513 has 8 divisors (see below), whose sum is σ = 14539925376. Its totient is φ = 7216506000.

The previous prime is 10864851463. The next prime is 10864851523. The reversal of 10864851513 is 31515846801.

10864851513 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 10864851513 - 210 = 10864850489 is a prime.

It is not an unprimeable number, because it can be changed into a prime (10864851523) 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, 6681138 + ... + 6682763.

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

Almost surely, 210864851513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13364175.

The product of its (nonzero) digits is 115200, while the sum is 42.

The spelling of 10864851513 in words is "ten billion, eight hundred sixty-four million, eight hundred fifty-one thousand, five hundred thirteen".

Divisors: 1 3 271 813 13363901 40091703 3621617171 10864851513