Search a number
-
+
10471719131 = 46032274977
BaseRepresentation
bin10011100000010100…
…11100000011011011
31000000210101110010022
421300022130003123
5132421230003011
64451033141055
7520333100246
oct116012340333
930023343108
1010471719131
114494015635
122042b5a78b
13cab64cc13
14714a7625d
154144db8db
hex27029c0db

10471719131 has 4 divisors (see below), whose sum is σ = 10473998712. Its totient is φ = 10469439552.

The previous prime is 10471719119. The next prime is 10471719157. The reversal of 10471719131 is 13191717401.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13191717401 = 31425539271.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10471719131 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10471719091 and 10471719100.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1132886 + ... + 1142091.

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

Almost surely, 210471719131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2279580.

The product of its (nonzero) digits is 5292, while the sum is 35.

The spelling of 10471719131 in words is "ten billion, four hundred seventy-one million, seven hundred nineteen thousand, one hundred thirty-one".

Divisors: 1 4603 2274977 10471719131