Search a number
-
+
11692710053 = 33778744087
BaseRepresentation
bin10101110001111000…
…01001100010100101
31010011212220012210022
422320330021202211
5142421313210203
65212131204525
7562520252453
oct127074114245
933155805708
1011692710053
114a60259142
122323a46745
1311445b385b
147cccab9d3
154867c1a38
hex2b8f098a5

11692710053 has 8 divisors (see below), whose sum is σ = 11742574272. Its totient is φ = 11642936256.

The previous prime is 11692710049. The next prime is 11692710059. The reversal of 11692710053 is 35001729611.

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 11692710053 - 22 = 11692710049 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 211692710053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 45211.

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

The spelling of 11692710053 in words is "eleven billion, six hundred ninety-two million, seven hundred ten thousand, fifty-three".

Divisors: 1 337 787 44087 265219 14857319 34696469 11692710053