Search a number
-
+
10931999965 = 55937057627
BaseRepresentation
bin10100010111001100…
…10001010011011101
31001012212111010201121
422023212101103131
5134342042444330
65004434410541
7534622316005
oct121346212335
931185433647
1010931999965
1146aa913417
122151130a51
131052b09243
14759c4d005
1543eb0b17a
hex28b9914dd

10931999965 has 8 divisors (see below), whose sum is σ = 13340746080. Its totient is φ = 8597369232.

The previous prime is 10931999963. The next prime is 10931999987. The reversal of 10931999965 is 56999913901.

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

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 10931999965 - 21 = 10931999963 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10931999963) 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 7 ways as a sum of consecutive naturals, for example, 18528519 + ... + 18529108.

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

Almost surely, 210931999965 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 37057691.

The product of its (nonzero) digits is 5314410, while the sum is 61.

The spelling of 10931999965 in words is "ten billion, nine hundred thirty-one million, nine hundred ninety-nine thousand, nine hundred sixty-five".

Divisors: 1 5 59 295 37057627 185288135 2186399993 10931999965