Search a number
-
+
11690537369 = 71670076767
BaseRepresentation
bin10101110001100111…
…10111000110011001
31010011201210211102112
422320303313012121
5142420234143434
65212012442105
7562462633220
oct127063670631
933151724375
1011690537369
114a5a004835
122323179335
131144002944
147cc8a3cb7
154864e2dce
hex2b8cf7199

11690537369 has 4 divisors (see below), whose sum is σ = 13360614144. Its totient is φ = 10020460596.

The previous prime is 11690537363. The next prime is 11690537377. The reversal of 11690537369 is 96373509611.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11690537369 - 220 = 11689488793 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 211690537369 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1670076774.

The product of its (nonzero) digits is 918540, while the sum is 50.

The spelling of 11690537369 in words is "eleven billion, six hundred ninety million, five hundred thirty-seven thousand, three hundred sixty-nine".

Divisors: 1 7 1670076767 11690537369