Search a number
-
+
65111113 = 117155603
BaseRepresentation
bin1111100001100…
…0010001001001
311112111222122201
43320120101021
5113132023423
610243320201
71420302214
oct370302111
9145458581
1065111113
1133831a41
1219980061
13106494b2
14890c77b
155ab22ad
hex3e18449

65111113 has 4 divisors (see below), whose sum is σ = 65167888. Its totient is φ = 65054340.

The previous prime is 65111107. The next prime is 65111117. The reversal of 65111113 is 31111156.

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 a de Polignac number, because none of the positive numbers 2k-65111113 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 265111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 56774.

The product of its digits is 90, while the sum is 19.

The square root of 65111113 is about 8069.1457416507. The cubic root of 65111113 is about 402.3015505139.

Adding to 65111113 its reverse (31111156), we get a palindrome (96222269).

The spelling of 65111113 in words is "sixty-five million, one hundred eleven thousand, one hundred thirteen".

Divisors: 1 1171 55603 65111113