Search a number
-
+
20111513 = 131153523
BaseRepresentation
bin100110010111…
…0000010011001
31101211202210212
41030232002121
520122032023
61555020505
7332642102
oct114560231
941752725
1020111513
1110397094
12689a735
134222106
1429573a9
151b73e78
hex132e099

20111513 has 4 divisors (see below), whose sum is σ = 20265168. Its totient is φ = 19957860.

The previous prime is 20111501. The next prime is 20111563. The reversal of 20111513 is 31511102.

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 20111513 - 28 = 20111257 is a prime.

It is a Duffinian number.

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

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

Almost surely, 220111513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 153654.

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 20111513 is about 4484.5861570495. The cubic root of 20111513 is about 271.9453150229.

Adding to 20111513 its reverse (31511102), we get a palindrome (51622615).

The spelling of 20111513 in words is "twenty million, one hundred eleven thousand, five hundred thirteen".

Divisors: 1 131 153523 20111513