Search a number
-
+
10661714915 = 513915340597
BaseRepresentation
bin10011110110111110…
…01101101111100011
31000112000220020100012
421323133031233203
5133313344334130
64521541315135
7525131036645
oct117337155743
930460806305
1010661714915
114581295245
122096705aab
13100bb13767
14731db2895
1542601b995
hex27b7cdbe3

10661714915 has 8 divisors (see below), whose sum is σ = 12886102320. Its totient is φ = 8468008992.

The previous prime is 10661714911. The next prime is 10661714923. The reversal of 10661714915 is 51941716601.

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

It is not a de Polignac number, because 10661714915 - 22 = 10661714911 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210661714915 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15340741.

The product of its (nonzero) digits is 45360, while the sum is 41.

The spelling of 10661714915 in words is "ten billion, six hundred sixty-one million, seven hundred fourteen thousand, nine hundred fifteen".

Divisors: 1 5 139 695 15340597 76702985 2132342983 10661714915