Search a number
-
+
11695283713 = 3714916712703
BaseRepresentation
bin10101110010001011…
…11101111000000001
31010012001201222012001
422321011331320001
5142422443034323
65212302304001
7562551162031
oct127105757001
933161658161
1011695283713
114a61756833
122324888001
131144ca5129
147cd37b8c1
15486b2e3ad
hex2b917de01

11695283713 has 16 divisors (see below), whose sum is σ = 12165350400. Its totient is φ = 11234258496.

The previous prime is 11695283711. The next prime is 11695283759. The reversal of 11695283713 is 31738259611.

It is a happy number.

11695283713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11695283713 - 21 = 11695283711 is a prime.

It is a super-2 number, since 2×116952837132 (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 (11695283711) 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 15 ways as a sum of consecutive naturals, for example, 914320 + ... + 927022.

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

Almost surely, 211695283713 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13056.

The product of its digits is 272160, while the sum is 46.

The spelling of 11695283713 in words is "eleven billion, six hundred ninety-five million, two hundred eighty-three thousand, seven hundred thirteen".

Divisors: 1 37 149 167 5513 6179 12703 24883 470011 920671 1892747 2121401 70031639 78491837 316088749 11695283713